
Here we will show you how to convert the hexadecimal number F28F 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 F28F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F28F by 16⁰, multiply the second to last digit in F28F by 16¹, multiply the third to last digit in F28F by 16², multiply the fourth to last digit in F28F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
8 × 16¹ = 128
2 × 16² = 512
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:
15 + 128 + 512 + 61440 = 62095
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.
62095 ÷ 2 = 31047 with 1 remainder
31047 ÷ 2 = 15523 with 1 remainder
15523 ÷ 2 = 7761 with 1 remainder
7761 ÷ 2 = 3880 with 1 remainder
3880 ÷ 2 = 1940 with 0 remainder
1940 ÷ 2 = 970 with 0 remainder
970 ÷ 2 = 485 with 0 remainder
485 ÷ 2 = 242 with 1 remainder
242 ÷ 2 = 121 with 0 remainder
121 ÷ 2 = 60 with 1 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 F28F hexadecimal to binary:
F28F hexadecimal = 1111001010001111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F290 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
