
Here we will show you how to convert the hexadecimal number E39C 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 E39C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E39C by 16⁰, multiply the second to last digit in E39C by 16¹, multiply the third to last digit in E39C by 16², multiply the fourth to last digit in E39C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
9 × 16¹ = 144
3 × 16² = 768
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:
12 + 144 + 768 + 57344 = 58268
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.
58268 ÷ 2 = 29134 with 0 remainder
29134 ÷ 2 = 14567 with 0 remainder
14567 ÷ 2 = 7283 with 1 remainder
7283 ÷ 2 = 3641 with 1 remainder
3641 ÷ 2 = 1820 with 1 remainder
1820 ÷ 2 = 910 with 0 remainder
910 ÷ 2 = 455 with 0 remainder
455 ÷ 2 = 227 with 1 remainder
227 ÷ 2 = 113 with 1 remainder
113 ÷ 2 = 56 with 1 remainder
56 ÷ 2 = 28 with 0 remainder
28 ÷ 2 = 14 with 0 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 E39C hexadecimal to binary:
E39C hexadecimal = 1110001110011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E39D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
