
Here we will show you how to convert the hexadecimal number B90F 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 B90F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B90F by 16⁰, multiply the second to last digit in B90F by 16¹, multiply the third to last digit in B90F by 16², multiply the fourth to last digit in B90F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
0 × 16¹ = 0
9 × 16² = 2304
B × 16³ = 45056
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 + 0 + 2304 + 45056 = 47375
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.
47375 ÷ 2 = 23687 with 1 remainder
23687 ÷ 2 = 11843 with 1 remainder
11843 ÷ 2 = 5921 with 1 remainder
5921 ÷ 2 = 2960 with 1 remainder
2960 ÷ 2 = 1480 with 0 remainder
1480 ÷ 2 = 740 with 0 remainder
740 ÷ 2 = 370 with 0 remainder
370 ÷ 2 = 185 with 0 remainder
185 ÷ 2 = 92 with 1 remainder
92 ÷ 2 = 46 with 0 remainder
46 ÷ 2 = 23 with 0 remainder
23 ÷ 2 = 11 with 1 remainder
11 ÷ 2 = 5 with 1 remainder
5 ÷ 2 = 2 with 1 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 B90F hexadecimal to binary:
B90F hexadecimal = 1011100100001111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B910 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
