
Here we will show you how to convert the hexadecimal number F8A0 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 F8A0 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F8A0 by 16⁰, multiply the second to last digit in F8A0 by 16¹, multiply the third to last digit in F8A0 by 16², multiply the fourth to last digit in F8A0 by 16³, and so on, until all the digits are used.
0 × 16⁰ = 0
A × 16¹ = 160
8 × 16² = 2048
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:
0 + 160 + 2048 + 61440 = 63648
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.
63648 ÷ 2 = 31824 with 0 remainder
31824 ÷ 2 = 15912 with 0 remainder
15912 ÷ 2 = 7956 with 0 remainder
7956 ÷ 2 = 3978 with 0 remainder
3978 ÷ 2 = 1989 with 0 remainder
1989 ÷ 2 = 994 with 1 remainder
994 ÷ 2 = 497 with 0 remainder
497 ÷ 2 = 248 with 1 remainder
248 ÷ 2 = 124 with 0 remainder
124 ÷ 2 = 62 with 0 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 F8A0 hexadecimal to binary:
F8A0 hexadecimal = 1111100010100000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F8A1 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact