
Here we will show you how to convert the hexadecimal number A49C 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 A49C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in A49C by 16⁰, multiply the second to last digit in A49C by 16¹, multiply the third to last digit in A49C by 16², multiply the fourth to last digit in A49C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
9 × 16¹ = 144
4 × 16² = 1024
A × 16³ = 40960
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 + 40960 = 42140
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.
42140 ÷ 2 = 21070 with 0 remainder
21070 ÷ 2 = 10535 with 0 remainder
10535 ÷ 2 = 5267 with 1 remainder
5267 ÷ 2 = 2633 with 1 remainder
2633 ÷ 2 = 1316 with 1 remainder
1316 ÷ 2 = 658 with 0 remainder
658 ÷ 2 = 329 with 0 remainder
329 ÷ 2 = 164 with 1 remainder
164 ÷ 2 = 82 with 0 remainder
82 ÷ 2 = 41 with 0 remainder
41 ÷ 2 = 20 with 1 remainder
20 ÷ 2 = 10 with 0 remainder
10 ÷ 2 = 5 with 0 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 A49C hexadecimal to binary:
A49C hexadecimal = 1010010010011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
A49D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
