Compute the bitwise AND of two numbers:

The binary representation of 13 has ones at positions where the binary representations of 61 and 15 both have ones:

Use numbers of any size:

BitAnd takes any number of arguments:

Use negative numbers:

Basic symbolic simplifications are done automatically:

Extract the second-lowest-order bits in numbers:

Truth table for And:

"Mask" to test whether bits 3 or 4 are 1:

Test for powers of 2:

Make a nested pattern:

This structure corresponds to the Sierpiński gasket:

Plot the BitAnd of with :

Plot the BitAnd of with :

Plot the BitAnd of with and :

-1 corresponds to having all bits on:

The BitAnd of any number of copies of a number with itself is that number:

BitAnd automatically threads over lists:

BitAnd is Orderless:

Plotting BitAnd[x,y] in the plane shows a nested pattern of squares:

Plotting in three dimensions reveals a fractal structure:

This structure corresponds to the Sierpiński sponge: