
Here we will show you how to convert the hexadecimal number B625 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 B625 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B625 by 16⁰, multiply the second to last digit in B625 by 16¹, multiply the third to last digit in B625 by 16², multiply the fourth to last digit in B625 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
2 × 16¹ = 32
6 × 16² = 1536
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:
5 + 32 + 1536 + 45056 = 46629
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.
46629 ÷ 2 = 23314 with 1 remainder
23314 ÷ 2 = 11657 with 0 remainder
11657 ÷ 2 = 5828 with 1 remainder
5828 ÷ 2 = 2914 with 0 remainder
2914 ÷ 2 = 1457 with 0 remainder
1457 ÷ 2 = 728 with 1 remainder
728 ÷ 2 = 364 with 0 remainder
364 ÷ 2 = 182 with 0 remainder
182 ÷ 2 = 91 with 0 remainder
91 ÷ 2 = 45 with 1 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 B625 hexadecimal to binary:
B625 hexadecimal = 1011011000100101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B626 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
