
Here we will show you how to convert the hexadecimal number D243 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 D243 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D243 by 16⁰, multiply the second to last digit in D243 by 16¹, multiply the third to last digit in D243 by 16², multiply the fourth to last digit in D243 by 16³, and so on, until all the digits are used.
3 × 16⁰ = 3
4 × 16¹ = 64
2 × 16² = 512
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:
3 + 64 + 512 + 53248 = 53827
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.
53827 ÷ 2 = 26913 with 1 remainder
26913 ÷ 2 = 13456 with 1 remainder
13456 ÷ 2 = 6728 with 0 remainder
6728 ÷ 2 = 3364 with 0 remainder
3364 ÷ 2 = 1682 with 0 remainder
1682 ÷ 2 = 841 with 0 remainder
841 ÷ 2 = 420 with 1 remainder
420 ÷ 2 = 210 with 0 remainder
210 ÷ 2 = 105 with 0 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 D243 hexadecimal to binary:
D243 hexadecimal = 1101001001000011 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D244 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
