
Here we will show you how to convert the hexadecimal number D3A1 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 D3A1 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D3A1 by 16⁰, multiply the second to last digit in D3A1 by 16¹, multiply the third to last digit in D3A1 by 16², multiply the fourth to last digit in D3A1 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
A × 16¹ = 160
3 × 16² = 768
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:
1 + 160 + 768 + 53248 = 54177
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.
54177 ÷ 2 = 27088 with 1 remainder
27088 ÷ 2 = 13544 with 0 remainder
13544 ÷ 2 = 6772 with 0 remainder
6772 ÷ 2 = 3386 with 0 remainder
3386 ÷ 2 = 1693 with 0 remainder
1693 ÷ 2 = 846 with 1 remainder
846 ÷ 2 = 423 with 0 remainder
423 ÷ 2 = 211 with 1 remainder
211 ÷ 2 = 105 with 1 remainder
105 ÷ 2 = 52 with 1 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 D3A1 hexadecimal to binary:
D3A1 hexadecimal = 1101001110100001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D3A2 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
