
Here we will show you how to convert the hexadecimal number DF6A 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 DF6A from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DF6A by 16⁰, multiply the second to last digit in DF6A by 16¹, multiply the third to last digit in DF6A by 16², multiply the fourth to last digit in DF6A by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
6 × 16¹ = 96
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:
10 + 96 + 3840 + 53248 = 57194
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.
57194 ÷ 2 = 28597 with 0 remainder
28597 ÷ 2 = 14298 with 1 remainder
14298 ÷ 2 = 7149 with 0 remainder
7149 ÷ 2 = 3574 with 1 remainder
3574 ÷ 2 = 1787 with 0 remainder
1787 ÷ 2 = 893 with 1 remainder
893 ÷ 2 = 446 with 1 remainder
446 ÷ 2 = 223 with 0 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 DF6A hexadecimal to binary:
DF6A hexadecimal = 1101111101101010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DF6B hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
