
Here we will show you how to convert the hexadecimal number F1FC 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 F1FC from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F1FC by 16⁰, multiply the second to last digit in F1FC by 16¹, multiply the third to last digit in F1FC by 16², multiply the fourth to last digit in F1FC by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
F × 16¹ = 240
1 × 16² = 256
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:
12 + 240 + 256 + 61440 = 61948
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.
61948 ÷ 2 = 30974 with 0 remainder
30974 ÷ 2 = 15487 with 0 remainder
15487 ÷ 2 = 7743 with 1 remainder
7743 ÷ 2 = 3871 with 1 remainder
3871 ÷ 2 = 1935 with 1 remainder
1935 ÷ 2 = 967 with 1 remainder
967 ÷ 2 = 483 with 1 remainder
483 ÷ 2 = 241 with 1 remainder
241 ÷ 2 = 120 with 1 remainder
120 ÷ 2 = 60 with 0 remainder
60 ÷ 2 = 30 with 0 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 F1FC hexadecimal to binary:
F1FC hexadecimal = 1111000111111100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F1FD hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
