
Here we will show you how to convert the hexadecimal number C396 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 C396 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in C396 by 16⁰, multiply the second to last digit in C396 by 16¹, multiply the third to last digit in C396 by 16², multiply the fourth to last digit in C396 by 16³, and so on, until all the digits are used.
6 × 16⁰ = 6
9 × 16¹ = 144
3 × 16² = 768
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:
6 + 144 + 768 + 49152 = 50070
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.
50070 ÷ 2 = 25035 with 0 remainder
25035 ÷ 2 = 12517 with 1 remainder
12517 ÷ 2 = 6258 with 1 remainder
6258 ÷ 2 = 3129 with 0 remainder
3129 ÷ 2 = 1564 with 1 remainder
1564 ÷ 2 = 782 with 0 remainder
782 ÷ 2 = 391 with 0 remainder
391 ÷ 2 = 195 with 1 remainder
195 ÷ 2 = 97 with 1 remainder
97 ÷ 2 = 48 with 1 remainder
48 ÷ 2 = 24 with 0 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 C396 hexadecimal to binary:
C396 hexadecimal = 1100001110010110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
C397 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
