
Here we will show you how to convert the hexadecimal number CC1F 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 CC1F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in CC1F by 16⁰, multiply the second to last digit in CC1F by 16¹, multiply the third to last digit in CC1F by 16², multiply the fourth to last digit in CC1F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
1 × 16¹ = 16
C × 16² = 3072
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:
15 + 16 + 3072 + 49152 = 52255
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.
52255 ÷ 2 = 26127 with 1 remainder
26127 ÷ 2 = 13063 with 1 remainder
13063 ÷ 2 = 6531 with 1 remainder
6531 ÷ 2 = 3265 with 1 remainder
3265 ÷ 2 = 1632 with 1 remainder
1632 ÷ 2 = 816 with 0 remainder
816 ÷ 2 = 408 with 0 remainder
408 ÷ 2 = 204 with 0 remainder
204 ÷ 2 = 102 with 0 remainder
102 ÷ 2 = 51 with 0 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 CC1F hexadecimal to binary:
CC1F hexadecimal = 1100110000011111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
CC20 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
