
Here we will show you how to convert the hexadecimal number ED99 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 ED99 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in ED99 by 16⁰, multiply the second to last digit in ED99 by 16¹, multiply the third to last digit in ED99 by 16², multiply the fourth to last digit in ED99 by 16³, and so on, until all the digits are used.
9 × 16⁰ = 9
9 × 16¹ = 144
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:
9 + 144 + 3328 + 57344 = 60825
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.
60825 ÷ 2 = 30412 with 1 remainder
30412 ÷ 2 = 15206 with 0 remainder
15206 ÷ 2 = 7603 with 0 remainder
7603 ÷ 2 = 3801 with 1 remainder
3801 ÷ 2 = 1900 with 1 remainder
1900 ÷ 2 = 950 with 0 remainder
950 ÷ 2 = 475 with 0 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 ED99 hexadecimal to binary:
ED99 hexadecimal = 1110110110011001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
ED9A hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
