
Here we will show you how to convert the hexadecimal number EDD0 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 EDD0 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in EDD0 by 16⁰, multiply the second to last digit in EDD0 by 16¹, multiply the third to last digit in EDD0 by 16², multiply the fourth to last digit in EDD0 by 16³, and so on, until all the digits are used.
0 × 16⁰ = 0
D × 16¹ = 208
D × 16² = 3328
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:
0 + 208 + 3328 + 57344 = 60880
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.
60880 ÷ 2 = 30440 with 0 remainder
30440 ÷ 2 = 15220 with 0 remainder
15220 ÷ 2 = 7610 with 0 remainder
7610 ÷ 2 = 3805 with 0 remainder
3805 ÷ 2 = 1902 with 1 remainder
1902 ÷ 2 = 951 with 0 remainder
951 ÷ 2 = 475 with 1 remainder
475 ÷ 2 = 237 with 1 remainder
237 ÷ 2 = 118 with 1 remainder
118 ÷ 2 = 59 with 0 remainder
59 ÷ 2 = 29 with 1 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 EDD0 hexadecimal to binary:
EDD0 hexadecimal = 1110110111010000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
EDD1 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
