
Here we will show you how to convert the hexadecimal number C2F3 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 C2F3 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in C2F3 by 16⁰, multiply the second to last digit in C2F3 by 16¹, multiply the third to last digit in C2F3 by 16², multiply the fourth to last digit in C2F3 by 16³, and so on, until all the digits are used.
3 × 16⁰ = 3
F × 16¹ = 240
2 × 16² = 512
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 + 240 + 512 + 49152 = 49907
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.
49907 ÷ 2 = 24953 with 1 remainder
24953 ÷ 2 = 12476 with 1 remainder
12476 ÷ 2 = 6238 with 0 remainder
6238 ÷ 2 = 3119 with 0 remainder
3119 ÷ 2 = 1559 with 1 remainder
1559 ÷ 2 = 779 with 1 remainder
779 ÷ 2 = 389 with 1 remainder
389 ÷ 2 = 194 with 1 remainder
194 ÷ 2 = 97 with 0 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 C2F3 hexadecimal to binary:
C2F3 hexadecimal = 1100001011110011 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
C2F4 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
