
Here we will show you how to convert the hexadecimal number B49C 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 B49C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B49C by 16⁰, multiply the second to last digit in B49C by 16¹, multiply the third to last digit in B49C by 16², multiply the fourth to last digit in B49C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
9 × 16¹ = 144
4 × 16² = 1024
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:
12 + 144 + 1024 + 45056 = 46236
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.
46236 ÷ 2 = 23118 with 0 remainder
23118 ÷ 2 = 11559 with 0 remainder
11559 ÷ 2 = 5779 with 1 remainder
5779 ÷ 2 = 2889 with 1 remainder
2889 ÷ 2 = 1444 with 1 remainder
1444 ÷ 2 = 722 with 0 remainder
722 ÷ 2 = 361 with 0 remainder
361 ÷ 2 = 180 with 1 remainder
180 ÷ 2 = 90 with 0 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 B49C hexadecimal to binary:
B49C hexadecimal = 1011010010011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B49D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
