
Here we will show you how to convert the hexadecimal number 8F9F 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 8F9F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in 8F9F by 16⁰, multiply the second to last digit in 8F9F by 16¹, multiply the third to last digit in 8F9F by 16², multiply the fourth to last digit in 8F9F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
9 × 16¹ = 144
F × 16² = 3840
8 × 16³ = 32768
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 + 144 + 3840 + 32768 = 36767
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.
36767 ÷ 2 = 18383 with 1 remainder
18383 ÷ 2 = 9191 with 1 remainder
9191 ÷ 2 = 4595 with 1 remainder
4595 ÷ 2 = 2297 with 1 remainder
2297 ÷ 2 = 1148 with 1 remainder
1148 ÷ 2 = 574 with 0 remainder
574 ÷ 2 = 287 with 0 remainder
287 ÷ 2 = 143 with 1 remainder
143 ÷ 2 = 71 with 1 remainder
71 ÷ 2 = 35 with 1 remainder
35 ÷ 2 = 17 with 1 remainder
17 ÷ 2 = 8 with 1 remainder
8 ÷ 2 = 4 with 0 remainder
4 ÷ 2 = 2 with 0 remainder
2 ÷ 2 = 1 with 0 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 8F9F hexadecimal to binary:
8F9F hexadecimal = 1000111110011111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
8FA0 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact