
Here we will show you how to convert the hexadecimal number D407 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 D407 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D407 by 16⁰, multiply the second to last digit in D407 by 16¹, multiply the third to last digit in D407 by 16², multiply the fourth to last digit in D407 by 16³, and so on, until all the digits are used.
7 × 16⁰ = 7
0 × 16¹ = 0
4 × 16² = 1024
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:
7 + 0 + 1024 + 53248 = 54279
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.
54279 ÷ 2 = 27139 with 1 remainder
27139 ÷ 2 = 13569 with 1 remainder
13569 ÷ 2 = 6784 with 1 remainder
6784 ÷ 2 = 3392 with 0 remainder
3392 ÷ 2 = 1696 with 0 remainder
1696 ÷ 2 = 848 with 0 remainder
848 ÷ 2 = 424 with 0 remainder
424 ÷ 2 = 212 with 0 remainder
212 ÷ 2 = 106 with 0 remainder
106 ÷ 2 = 53 with 0 remainder
53 ÷ 2 = 26 with 1 remainder
26 ÷ 2 = 13 with 0 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 D407 hexadecimal to binary:
D407 hexadecimal = 1101010000000111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D408 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
