
Here we will show you how to convert the hexadecimal number C8C5 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 C8C5 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in C8C5 by 16⁰, multiply the second to last digit in C8C5 by 16¹, multiply the third to last digit in C8C5 by 16², multiply the fourth to last digit in C8C5 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
C × 16¹ = 192
8 × 16² = 2048
C × 16³ = 49152
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 + 192 + 2048 + 49152 = 51397
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.
51397 ÷ 2 = 25698 with 1 remainder
25698 ÷ 2 = 12849 with 0 remainder
12849 ÷ 2 = 6424 with 1 remainder
6424 ÷ 2 = 3212 with 0 remainder
3212 ÷ 2 = 1606 with 0 remainder
1606 ÷ 2 = 803 with 0 remainder
803 ÷ 2 = 401 with 1 remainder
401 ÷ 2 = 200 with 1 remainder
200 ÷ 2 = 100 with 0 remainder
100 ÷ 2 = 50 with 0 remainder
50 ÷ 2 = 25 with 0 remainder
25 ÷ 2 = 12 with 1 remainder
12 ÷ 2 = 6 with 0 remainder
6 ÷ 2 = 3 with 0 remainder
3 ÷ 2 = 1 with 1 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 C8C5 hexadecimal to binary:
C8C5 hexadecimal = 1100100011000101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
C8C6 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact