
Here we will show you how to convert the hexadecimal number C69C 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 C69C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in C69C by 16⁰, multiply the second to last digit in C69C by 16¹, multiply the third to last digit in C69C by 16², multiply the fourth to last digit in C69C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
9 × 16¹ = 144
6 × 16² = 1536
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:
12 + 144 + 1536 + 49152 = 50844
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.
50844 ÷ 2 = 25422 with 0 remainder
25422 ÷ 2 = 12711 with 0 remainder
12711 ÷ 2 = 6355 with 1 remainder
6355 ÷ 2 = 3177 with 1 remainder
3177 ÷ 2 = 1588 with 1 remainder
1588 ÷ 2 = 794 with 0 remainder
794 ÷ 2 = 397 with 0 remainder
397 ÷ 2 = 198 with 1 remainder
198 ÷ 2 = 99 with 0 remainder
99 ÷ 2 = 49 with 1 remainder
49 ÷ 2 = 24 with 1 remainder
24 ÷ 2 = 12 with 0 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 C69C hexadecimal to binary:
C69C hexadecimal = 1100011010011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
C69D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
