gives the bitwise AND of the integers ni.


  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • BitAnd[n1,n2,] yields the integer whose binary bit representation has ones at positions where the binary bit representations of all of the ni have ones.
  • For negative integers BitAnd assumes a two's complement representation.
  • BitAnd automatically threads over lists.


open allclose all

Basic Examples  (1)

Scope  (3)

Use numbers of any size:

BitAnd takes any number of arguments:

Use negative numbers:

Generalizations & Extensions  (1)

Basic symbolic simplifications are done automatically:

Applications  (5)

Extract the second-lowest-order bits in numbers:

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

Make a nested pattern:

Test for powers of 2:

Properties & Relations  (2)

Truth table for And:

BitAnd is Orderless:

Neat Examples  (1)

Introduced in 1999