# Bitwise AND (&), Bitwise OR (|), Bitwise XOR (^)

### Description and Syntax

##### In 86Duino, the type int is a 32-bit value, so using & between two int expressions causes 32 simultaneous AND operations to occur. In a code fragment like:
```    int a =  92;    // in binary: 00000000000000000000000001011100
int b = 101;    // in binary: 00000000000000000000000001100101
int c = a & b;  // result:    00000000000000000000000001000100, or 68 in decimal.
```
##### Here is an example of the bitwise OR used in a snippet of C++ code:
```    int a =  92;    // in binary: 00000000000000000000000001011100
int b = 101;    // in binary: 00000000000000000000000001100101
int c = a | b;  // result:    00000000000000000000000001111101, or 125 in decimal.
```
##### Another way to look at bitwise XOR is that each bit in the result is a 1 if the input bits are different, or 0 if they are the same.Here is a simple code example:
```    int x = 12;     // binary: 1100
int y = 10;     // binary: 1010
int z = x ^ y;  // binary: 0110, or decimal 6
```