Finding if a number is a power of 2

Question

Just out of curiosity, how can you tell if a number x is a power of two (x = 2^n) without using recursion.

Thanks

Answer 1

In a binary equivalent of any decimal number which is a power of two will have only one occurrence of 1 in its binary equivalent.