
Here we will show you how to convert the hexadecimal number B22D 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 B22D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B22D by 16⁰, multiply the second to last digit in B22D by 16¹, multiply the third to last digit in B22D by 16², multiply the fourth to last digit in B22D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
2 × 16¹ = 32
2 × 16² = 512
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:
13 + 32 + 512 + 45056 = 45613
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.
45613 ÷ 2 = 22806 with 1 remainder
22806 ÷ 2 = 11403 with 0 remainder
11403 ÷ 2 = 5701 with 1 remainder
5701 ÷ 2 = 2850 with 1 remainder
2850 ÷ 2 = 1425 with 0 remainder
1425 ÷ 2 = 712 with 1 remainder
712 ÷ 2 = 356 with 0 remainder
356 ÷ 2 = 178 with 0 remainder
178 ÷ 2 = 89 with 0 remainder
89 ÷ 2 = 44 with 1 remainder
44 ÷ 2 = 22 with 0 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 B22D hexadecimal to binary:
B22D hexadecimal = 1011001000101101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B22E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
