
Here we will show you how to convert the hexadecimal number D71D 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 D71D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D71D by 16⁰, multiply the second to last digit in D71D by 16¹, multiply the third to last digit in D71D by 16², multiply the fourth to last digit in D71D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
1 × 16¹ = 16
7 × 16² = 1792
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:
13 + 16 + 1792 + 53248 = 55069
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.
55069 ÷ 2 = 27534 with 1 remainder
27534 ÷ 2 = 13767 with 0 remainder
13767 ÷ 2 = 6883 with 1 remainder
6883 ÷ 2 = 3441 with 1 remainder
3441 ÷ 2 = 1720 with 1 remainder
1720 ÷ 2 = 860 with 0 remainder
860 ÷ 2 = 430 with 0 remainder
430 ÷ 2 = 215 with 0 remainder
215 ÷ 2 = 107 with 1 remainder
107 ÷ 2 = 53 with 1 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 D71D hexadecimal to binary:
D71D hexadecimal = 1101011100011101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D71E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact