Power of 2?

Given a positive integer $n$, determine whether $n$ is a power of $2$ (i.e. $n=2^k$ for some integer $k\ge 0$) using a single expression. No loops, no recursion, no log tables.

What is the bit pattern of a power of two, and what bit operation exploits it?