
Here we will show you how to convert the hexadecimal number E0DF 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 E0DF from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E0DF by 16⁰, multiply the second to last digit in E0DF by 16¹, multiply the third to last digit in E0DF by 16², multiply the fourth to last digit in E0DF by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
D × 16¹ = 208
0 × 16² = 0
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:
15 + 208 + 0 + 57344 = 57567
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.
57567 ÷ 2 = 28783 with 1 remainder
28783 ÷ 2 = 14391 with 1 remainder
14391 ÷ 2 = 7195 with 1 remainder
7195 ÷ 2 = 3597 with 1 remainder
3597 ÷ 2 = 1798 with 1 remainder
1798 ÷ 2 = 899 with 0 remainder
899 ÷ 2 = 449 with 1 remainder
449 ÷ 2 = 224 with 1 remainder
224 ÷ 2 = 112 with 0 remainder
112 ÷ 2 = 56 with 0 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 E0DF hexadecimal to binary:
E0DF hexadecimal = 1110000011011111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E0E0 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
