
Here we will show you how to convert the hexadecimal number FA31 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 FA31 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FA31 by 16⁰, multiply the second to last digit in FA31 by 16¹, multiply the third to last digit in FA31 by 16², multiply the fourth to last digit in FA31 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
3 × 16¹ = 48
A × 16² = 2560
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:
1 + 48 + 2560 + 61440 = 64049
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.
64049 ÷ 2 = 32024 with 1 remainder
32024 ÷ 2 = 16012 with 0 remainder
16012 ÷ 2 = 8006 with 0 remainder
8006 ÷ 2 = 4003 with 0 remainder
4003 ÷ 2 = 2001 with 1 remainder
2001 ÷ 2 = 1000 with 1 remainder
1000 ÷ 2 = 500 with 0 remainder
500 ÷ 2 = 250 with 0 remainder
250 ÷ 2 = 125 with 0 remainder
125 ÷ 2 = 62 with 1 remainder
62 ÷ 2 = 31 with 0 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 FA31 hexadecimal to binary:
FA31 hexadecimal = 1111101000110001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FA32 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact