
Here we will show you how to convert the hexadecimal number DC1A 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 DC1A from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DC1A by 16⁰, multiply the second to last digit in DC1A by 16¹, multiply the third to last digit in DC1A by 16², multiply the fourth to last digit in DC1A by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
1 × 16¹ = 16
C × 16² = 3072
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 + 16 + 3072 + 53248 = 56346
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.
56346 ÷ 2 = 28173 with 0 remainder
28173 ÷ 2 = 14086 with 1 remainder
14086 ÷ 2 = 7043 with 0 remainder
7043 ÷ 2 = 3521 with 1 remainder
3521 ÷ 2 = 1760 with 1 remainder
1760 ÷ 2 = 880 with 0 remainder
880 ÷ 2 = 440 with 0 remainder
440 ÷ 2 = 220 with 0 remainder
220 ÷ 2 = 110 with 0 remainder
110 ÷ 2 = 55 with 0 remainder
55 ÷ 2 = 27 with 1 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 DC1A hexadecimal to binary:
DC1A hexadecimal = 1101110000011010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DC1B hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
