
Here we will show you how to convert the hexadecimal number A665 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 A665 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in A665 by 16⁰, multiply the second to last digit in A665 by 16¹, multiply the third to last digit in A665 by 16², multiply the fourth to last digit in A665 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
6 × 16¹ = 96
6 × 16² = 1536
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 + 1536 + 40960 = 42597
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.
42597 ÷ 2 = 21298 with 1 remainder
21298 ÷ 2 = 10649 with 0 remainder
10649 ÷ 2 = 5324 with 1 remainder
5324 ÷ 2 = 2662 with 0 remainder
2662 ÷ 2 = 1331 with 0 remainder
1331 ÷ 2 = 665 with 1 remainder
665 ÷ 2 = 332 with 1 remainder
332 ÷ 2 = 166 with 0 remainder
166 ÷ 2 = 83 with 0 remainder
83 ÷ 2 = 41 with 1 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 A665 hexadecimal to binary:
A665 hexadecimal = 1010011001100101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
A666 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
