A bitwise operator treats their operands as a set of 32 bits (zeros and ones), rather than as decimal, hexadecimal, or octal numbers. The binary representation of 10 is 1010, and the binary representation of 3 is 11. So, when the bitwise operators are applied to these values, the results are as follows:

Expression	Result	Binary Description
`10 & 3`	2	`1010 & 0011 = 0010`
`10 \| 3`	11	`1010 \| 0011 = 1011`
`10 ^ 3`	9	`1010 ^ 0011 = 1001`
`~10`	-11	`~ 0000 0000 … 0000 1010 = 1111 1111 … 1111 0101`
`10 << 2`	40	`0000 0000 … 0000 1010 << 2 = 0000 0000 … 0010 1000`
`-11 >> 2`	-3	`1111 1111 … 1111 0101 >> 2 = 1111 1111 … 1111 1101`
`-11 >>> 2`	1073741821	`1111 1111 … 1111 0101 >> 2 = 0011 1111 … 1111 1101`

The left shift operator (<<) shifts the first operand the specified number of bits, modulo 32, to the left. Excess bits shifted off to the left are discarded. Zero bits are shifted in from the right. The right shift operator (>>) shifts the first operand the specified number of bits to the right. Excess bits shifted off to the right are discarded. Copies of the leftmost bit are shifted in from the left. The unsigned right shift operator (>>>) (zero-fill right shift) shifts the first operand the specified number of bits to the right. Excess bits shifted off to the right are discarded. Zero bits are shifted in from the left.