
Here we will show you how to convert the hexadecimal number DCFA 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 DCFA from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DCFA by 16⁰, multiply the second to last digit in DCFA by 16¹, multiply the third to last digit in DCFA by 16², multiply the fourth to last digit in DCFA by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
F × 16¹ = 240
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 + 240 + 3072 + 53248 = 56570
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.
56570 ÷ 2 = 28285 with 0 remainder
28285 ÷ 2 = 14142 with 1 remainder
14142 ÷ 2 = 7071 with 0 remainder
7071 ÷ 2 = 3535 with 1 remainder
3535 ÷ 2 = 1767 with 1 remainder
1767 ÷ 2 = 883 with 1 remainder
883 ÷ 2 = 441 with 1 remainder
441 ÷ 2 = 220 with 1 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 DCFA hexadecimal to binary:
DCFA hexadecimal = 1101110011111010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DCFB hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
