
Here we will show you how to convert the hexadecimal number EAFD to a binary number. First note that the hexadecimal number system has sixteen different digits (0 1 2 3 4 5 6 7 8 9 A B C D E F) and the binary number system has only two different digits (0 and 1).
The four steps used to convert EAFD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in EAFD by 16⁰, multiply the second to last digit in EAFD by 16¹, multiply the third to last digit in EAFD by 16², multiply the fourth to last digit in EAFD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
F × 16¹ = 240
A × 16² = 2560
E × 16³ = 57344
Remember that the hexadecimal number system has sixteen different digits, so when doing the above calculation, we use the following values if applicable: A=10, B=11, C=12, D=13, E=14, and F=15.
Step 2)
Next, we add up all the products we got from Step 1, like this:
13 + 240 + 2560 + 57344 = 60157
Step 3)
Now we divide the sum from Step 2 by 2. Put the remainder aside. Then divide the whole part by 2 again, and put the remainder aside again. Keep doing this until the whole part is 0.
60157 ÷ 2 = 30078 with 1 remainder
30078 ÷ 2 = 15039 with 0 remainder
15039 ÷ 2 = 7519 with 1 remainder
7519 ÷ 2 = 3759 with 1 remainder
3759 ÷ 2 = 1879 with 1 remainder
1879 ÷ 2 = 939 with 1 remainder
939 ÷ 2 = 469 with 1 remainder
469 ÷ 2 = 234 with 1 remainder
234 ÷ 2 = 117 with 0 remainder
117 ÷ 2 = 58 with 1 remainder
58 ÷ 2 = 29 with 0 remainder
29 ÷ 2 = 14 with 1 remainder
14 ÷ 2 = 7 with 0 remainder
7 ÷ 2 = 3 with 1 remainder
3 ÷ 2 = 1 with 1 remainder
1 ÷ 2 = 0 with 1 remainder
Step 4)
In the final step, we take the remainders from Step 3 and put them together in reverse order to get our answer to EAFD hexadecimal to binary:
EAFD hexadecimal = 1110101011111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
EAFE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact