Answer:
See explanation for example.
Explanation:
Say we want to convert 567 to binary aka base 2.
Look for highest power of 2 that will go into 567.
2^x will get us close to 567.
You could solve 2^x=567 in take the whole part of the number.
x=log_2 (567)=approximately 9.1
Of course you don't have to use logarithms here. You could have just found 2^0,2^1,...,2^9. You could have kept increasing the power on 2 until you exceeded the number,567, you wanted and use the power of 2 just before that number, 567.
2^9=512
So what's left 567-512=55
2^6=64 so that's too much, so 2^5=32 is what we will go with next.
55-32=23
2^4=16 and now 23-16=7 is left
2^2=4 so 7-4=3 is left
2^1=2 so 3-2=1 is left
2^0=1 and there is nothing left over
So we had 1, 2^9
No 2^8,2^7,2^6
We had 1, 2^5
We had 1, 2^4
We had no 2^3
We had 1, 2^2
We had 1, 2^1
We had 1, 2^0
The binary aka base 2 representation of 567 is 1000110111.