
Here we will show you how to convert the hexadecimal number B558 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 B558 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B558 by 16⁰, multiply the second to last digit in B558 by 16¹, multiply the third to last digit in B558 by 16², multiply the fourth to last digit in B558 by 16³, and so on, until all the digits are used.
8 × 16⁰ = 8
5 × 16¹ = 80
5 × 16² = 1280
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:
8 + 80 + 1280 + 45056 = 46424
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.
46424 ÷ 2 = 23212 with 0 remainder
23212 ÷ 2 = 11606 with 0 remainder
11606 ÷ 2 = 5803 with 0 remainder
5803 ÷ 2 = 2901 with 1 remainder
2901 ÷ 2 = 1450 with 1 remainder
1450 ÷ 2 = 725 with 0 remainder
725 ÷ 2 = 362 with 1 remainder
362 ÷ 2 = 181 with 0 remainder
181 ÷ 2 = 90 with 1 remainder
90 ÷ 2 = 45 with 0 remainder
45 ÷ 2 = 22 with 1 remainder
22 ÷ 2 = 11 with 0 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 B558 hexadecimal to binary:
B558 hexadecimal = 1011010101011000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B559 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
