
Here we will show you how to convert the hexadecimal number A270 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 A270 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in A270 by 16⁰, multiply the second to last digit in A270 by 16¹, multiply the third to last digit in A270 by 16², multiply the fourth to last digit in A270 by 16³, and so on, until all the digits are used.
0 × 16⁰ = 0
7 × 16¹ = 112
2 × 16² = 512
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:
0 + 112 + 512 + 40960 = 41584
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.
41584 ÷ 2 = 20792 with 0 remainder
20792 ÷ 2 = 10396 with 0 remainder
10396 ÷ 2 = 5198 with 0 remainder
5198 ÷ 2 = 2599 with 0 remainder
2599 ÷ 2 = 1299 with 1 remainder
1299 ÷ 2 = 649 with 1 remainder
649 ÷ 2 = 324 with 1 remainder
324 ÷ 2 = 162 with 0 remainder
162 ÷ 2 = 81 with 0 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 A270 hexadecimal to binary:
A270 hexadecimal = 1010001001110000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
A271 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact