
Here we will show you how to convert the hexadecimal number CE03 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 CE03 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in CE03 by 16⁰, multiply the second to last digit in CE03 by 16¹, multiply the third to last digit in CE03 by 16², multiply the fourth to last digit in CE03 by 16³, and so on, until all the digits are used.
3 × 16⁰ = 3
0 × 16¹ = 0
E × 16² = 3584
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:
3 + 0 + 3584 + 49152 = 52739
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.
52739 ÷ 2 = 26369 with 1 remainder
26369 ÷ 2 = 13184 with 1 remainder
13184 ÷ 2 = 6592 with 0 remainder
6592 ÷ 2 = 3296 with 0 remainder
3296 ÷ 2 = 1648 with 0 remainder
1648 ÷ 2 = 824 with 0 remainder
824 ÷ 2 = 412 with 0 remainder
412 ÷ 2 = 206 with 0 remainder
206 ÷ 2 = 103 with 0 remainder
103 ÷ 2 = 51 with 1 remainder
51 ÷ 2 = 25 with 1 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 CE03 hexadecimal to binary:
CE03 hexadecimal = 1100111000000011 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
CE04 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
