
Here we will show you how to convert the hexadecimal number D1DA 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 D1DA from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D1DA by 16⁰, multiply the second to last digit in D1DA by 16¹, multiply the third to last digit in D1DA by 16², multiply the fourth to last digit in D1DA by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
D × 16¹ = 208
1 × 16² = 256
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:
10 + 208 + 256 + 53248 = 53722
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.
53722 ÷ 2 = 26861 with 0 remainder
26861 ÷ 2 = 13430 with 1 remainder
13430 ÷ 2 = 6715 with 0 remainder
6715 ÷ 2 = 3357 with 1 remainder
3357 ÷ 2 = 1678 with 1 remainder
1678 ÷ 2 = 839 with 0 remainder
839 ÷ 2 = 419 with 1 remainder
419 ÷ 2 = 209 with 1 remainder
209 ÷ 2 = 104 with 1 remainder
104 ÷ 2 = 52 with 0 remainder
52 ÷ 2 = 26 with 0 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 D1DA hexadecimal to binary:
D1DA hexadecimal = 1101000111011010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D1DB hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
