
Here we will show you how to convert the hexadecimal number EAC9 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 EAC9 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in EAC9 by 16⁰, multiply the second to last digit in EAC9 by 16¹, multiply the third to last digit in EAC9 by 16², multiply the fourth to last digit in EAC9 by 16³, and so on, until all the digits are used.
9 × 16⁰ = 9
C × 16¹ = 192
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:
9 + 192 + 2560 + 57344 = 60105
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.
60105 ÷ 2 = 30052 with 1 remainder
30052 ÷ 2 = 15026 with 0 remainder
15026 ÷ 2 = 7513 with 0 remainder
7513 ÷ 2 = 3756 with 1 remainder
3756 ÷ 2 = 1878 with 0 remainder
1878 ÷ 2 = 939 with 0 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 EAC9 hexadecimal to binary:
EAC9 hexadecimal = 1110101011001001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
EACA hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact