
Here we will show you how to convert the hexadecimal number ABFD 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 ABFD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in ABFD by 16⁰, multiply the second to last digit in ABFD by 16¹, multiply the third to last digit in ABFD by 16², multiply the fourth to last digit in ABFD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
F × 16¹ = 240
B × 16² = 2816
A × 16³ = 40960
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:
13 + 240 + 2816 + 40960 = 44029
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.
44029 ÷ 2 = 22014 with 1 remainder
22014 ÷ 2 = 11007 with 0 remainder
11007 ÷ 2 = 5503 with 1 remainder
5503 ÷ 2 = 2751 with 1 remainder
2751 ÷ 2 = 1375 with 1 remainder
1375 ÷ 2 = 687 with 1 remainder
687 ÷ 2 = 343 with 1 remainder
343 ÷ 2 = 171 with 1 remainder
171 ÷ 2 = 85 with 1 remainder
85 ÷ 2 = 42 with 1 remainder
42 ÷ 2 = 21 with 0 remainder
21 ÷ 2 = 10 with 1 remainder
10 ÷ 2 = 5 with 0 remainder
5 ÷ 2 = 2 with 1 remainder
2 ÷ 2 = 1 with 0 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 ABFD hexadecimal to binary:
ABFD hexadecimal = 1010101111111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
ABFE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact