
Here we will show you how to convert the hexadecimal number A865 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 A865 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in A865 by 16⁰, multiply the second to last digit in A865 by 16¹, multiply the third to last digit in A865 by 16², multiply the fourth to last digit in A865 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
6 × 16¹ = 96
8 × 16² = 2048
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:
5 + 96 + 2048 + 40960 = 43109
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.
43109 ÷ 2 = 21554 with 1 remainder
21554 ÷ 2 = 10777 with 0 remainder
10777 ÷ 2 = 5388 with 1 remainder
5388 ÷ 2 = 2694 with 0 remainder
2694 ÷ 2 = 1347 with 0 remainder
1347 ÷ 2 = 673 with 1 remainder
673 ÷ 2 = 336 with 1 remainder
336 ÷ 2 = 168 with 0 remainder
168 ÷ 2 = 84 with 0 remainder
84 ÷ 2 = 42 with 0 remainder
42 ÷ 2 = 21 with 0 remainder
21 ÷ 2 = 10 with 1 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 A865 hexadecimal to binary:
A865 hexadecimal = 1010100001100101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
A866 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
