
Here we will show you how to convert the hexadecimal number C96E 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 C96E from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in C96E by 16⁰, multiply the second to last digit in C96E by 16¹, multiply the third to last digit in C96E by 16², multiply the fourth to last digit in C96E by 16³, and so on, until all the digits are used.
E × 16⁰ = 14
6 × 16¹ = 96
9 × 16² = 2304
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:
14 + 96 + 2304 + 49152 = 51566
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.
51566 ÷ 2 = 25783 with 0 remainder
25783 ÷ 2 = 12891 with 1 remainder
12891 ÷ 2 = 6445 with 1 remainder
6445 ÷ 2 = 3222 with 1 remainder
3222 ÷ 2 = 1611 with 0 remainder
1611 ÷ 2 = 805 with 1 remainder
805 ÷ 2 = 402 with 1 remainder
402 ÷ 2 = 201 with 0 remainder
201 ÷ 2 = 100 with 1 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 C96E hexadecimal to binary:
C96E hexadecimal = 1100100101101110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
C96F hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
