
Here we will show you how to convert the hexadecimal number FD14 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 FD14 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FD14 by 16⁰, multiply the second to last digit in FD14 by 16¹, multiply the third to last digit in FD14 by 16², multiply the fourth to last digit in FD14 by 16³, and so on, until all the digits are used.
4 × 16⁰ = 4
1 × 16¹ = 16
D × 16² = 3328
F × 16³ = 61440
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:
4 + 16 + 3328 + 61440 = 64788
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.
64788 ÷ 2 = 32394 with 0 remainder
32394 ÷ 2 = 16197 with 0 remainder
16197 ÷ 2 = 8098 with 1 remainder
8098 ÷ 2 = 4049 with 0 remainder
4049 ÷ 2 = 2024 with 1 remainder
2024 ÷ 2 = 1012 with 0 remainder
1012 ÷ 2 = 506 with 0 remainder
506 ÷ 2 = 253 with 0 remainder
253 ÷ 2 = 126 with 1 remainder
126 ÷ 2 = 63 with 0 remainder
63 ÷ 2 = 31 with 1 remainder
31 ÷ 2 = 15 with 1 remainder
15 ÷ 2 = 7 with 1 remainder
7 ÷ 2 = 3 with 1 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 FD14 hexadecimal to binary:
FD14 hexadecimal = 1111110100010100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FD15 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
