Each digit place holder represents a power of 2.
From the right hand place and reading to the left these are: 2^0, 2^1, 2^2, 2^3, 2^4 and 2^5 which are equivalent to 1, 2, 4, 8, 16 and 32.
To calculate the number equivalent to a binary number code such as above, you need to add up the relevant parts according to whether the place is included or excluded from the binary sum.
The '0' and '1' are 'switches' that tell you to include or exclude the number in that place when adding up the number.
example A - Binary 1010
This is equal to (2^1 + 2^3) = (2+8) = 10. Note that 2^0 and 2^2 are switched off (they have '0' place holder values) and hence excluded from the sum.
example B - Binary 1111
In this case all place holders are switched on and hence this is equal to (2^0 + ^1 + 2^2 + 2^3) = (1+2+4+8) = 15
example C - Binary 011111 as requested
This is equal to 31
Chat with our AI personalities
The number 21 in binary is 10101
63.
It is 894.
1024 = 10000000000
E7c3