
Here we will show you how to convert the hexadecimal number A32C 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 A32C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in A32C by 16⁰, multiply the second to last digit in A32C by 16¹, multiply the third to last digit in A32C by 16², multiply the fourth to last digit in A32C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
2 × 16¹ = 32
3 × 16² = 768
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 + 32 + 768 + 40960 = 41772
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.
41772 ÷ 2 = 20886 with 0 remainder
20886 ÷ 2 = 10443 with 0 remainder
10443 ÷ 2 = 5221 with 1 remainder
5221 ÷ 2 = 2610 with 1 remainder
2610 ÷ 2 = 1305 with 0 remainder
1305 ÷ 2 = 652 with 1 remainder
652 ÷ 2 = 326 with 0 remainder
326 ÷ 2 = 163 with 0 remainder
163 ÷ 2 = 81 with 1 remainder
81 ÷ 2 = 40 with 1 remainder
40 ÷ 2 = 20 with 0 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 A32C hexadecimal to binary:
A32C hexadecimal = 1010001100101100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
A32D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
