
Here we will show you how to convert the hexadecimal number F7A8 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 F7A8 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F7A8 by 16⁰, multiply the second to last digit in F7A8 by 16¹, multiply the third to last digit in F7A8 by 16², multiply the fourth to last digit in F7A8 by 16³, and so on, until all the digits are used.
8 × 16⁰ = 8
A × 16¹ = 160
7 × 16² = 1792
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:
8 + 160 + 1792 + 61440 = 63400
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.
63400 ÷ 2 = 31700 with 0 remainder
31700 ÷ 2 = 15850 with 0 remainder
15850 ÷ 2 = 7925 with 0 remainder
7925 ÷ 2 = 3962 with 1 remainder
3962 ÷ 2 = 1981 with 0 remainder
1981 ÷ 2 = 990 with 1 remainder
990 ÷ 2 = 495 with 0 remainder
495 ÷ 2 = 247 with 1 remainder
247 ÷ 2 = 123 with 1 remainder
123 ÷ 2 = 61 with 1 remainder
61 ÷ 2 = 30 with 1 remainder
30 ÷ 2 = 15 with 0 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 F7A8 hexadecimal to binary:
F7A8 hexadecimal = 1111011110101000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F7A9 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
