
Here we will show you how to convert the hexadecimal number DFAC 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 DFAC from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DFAC by 16⁰, multiply the second to last digit in DFAC by 16¹, multiply the third to last digit in DFAC by 16², multiply the fourth to last digit in DFAC by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
A × 16¹ = 160
F × 16² = 3840
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:
12 + 160 + 3840 + 53248 = 57260
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.
57260 ÷ 2 = 28630 with 0 remainder
28630 ÷ 2 = 14315 with 0 remainder
14315 ÷ 2 = 7157 with 1 remainder
7157 ÷ 2 = 3578 with 1 remainder
3578 ÷ 2 = 1789 with 0 remainder
1789 ÷ 2 = 894 with 1 remainder
894 ÷ 2 = 447 with 0 remainder
447 ÷ 2 = 223 with 1 remainder
223 ÷ 2 = 111 with 1 remainder
111 ÷ 2 = 55 with 1 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 DFAC hexadecimal to binary:
DFAC hexadecimal = 1101111110101100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DFAD hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
