
Here we will show you how to convert the hexadecimal number D51C 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 D51C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D51C by 16⁰, multiply the second to last digit in D51C by 16¹, multiply the third to last digit in D51C by 16², multiply the fourth to last digit in D51C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
1 × 16¹ = 16
5 × 16² = 1280
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:
12 + 16 + 1280 + 53248 = 54556
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.
54556 ÷ 2 = 27278 with 0 remainder
27278 ÷ 2 = 13639 with 0 remainder
13639 ÷ 2 = 6819 with 1 remainder
6819 ÷ 2 = 3409 with 1 remainder
3409 ÷ 2 = 1704 with 1 remainder
1704 ÷ 2 = 852 with 0 remainder
852 ÷ 2 = 426 with 0 remainder
426 ÷ 2 = 213 with 0 remainder
213 ÷ 2 = 106 with 1 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 D51C hexadecimal to binary:
D51C hexadecimal = 1101010100011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D51D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
