
Here we will show you how to convert the hexadecimal number D8E6 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 D8E6 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D8E6 by 16⁰, multiply the second to last digit in D8E6 by 16¹, multiply the third to last digit in D8E6 by 16², multiply the fourth to last digit in D8E6 by 16³, and so on, until all the digits are used.
6 × 16⁰ = 6
E × 16¹ = 224
8 × 16² = 2048
D × 16³ = 53248
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:
6 + 224 + 2048 + 53248 = 55526
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.
55526 ÷ 2 = 27763 with 0 remainder
27763 ÷ 2 = 13881 with 1 remainder
13881 ÷ 2 = 6940 with 1 remainder
6940 ÷ 2 = 3470 with 0 remainder
3470 ÷ 2 = 1735 with 0 remainder
1735 ÷ 2 = 867 with 1 remainder
867 ÷ 2 = 433 with 1 remainder
433 ÷ 2 = 216 with 1 remainder
216 ÷ 2 = 108 with 0 remainder
108 ÷ 2 = 54 with 0 remainder
54 ÷ 2 = 27 with 0 remainder
27 ÷ 2 = 13 with 1 remainder
13 ÷ 2 = 6 with 1 remainder
6 ÷ 2 = 3 with 0 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 D8E6 hexadecimal to binary:
D8E6 hexadecimal = 1101100011100110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D8E7 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
