Apply a signed 32-bit bitwise AND to two integers entered in decimal, binary, or hexadecimal.
Last updated: August 2026 | By Summa Calculator
Bitwise AND compares corresponding bits of two integers. The result bit is 1 only when both input bits are 1.
This is the same truth rule as Boolean AND, applied independently at every bit position.
Write both values in binary and align equal place values:
Only the 8's bit is 1 in both operands, so 12 AND 10 equals 8.
This implementation uses JavaScript's bitwise AND operator, which operates on signed 32-bit integers. Negative values are represented in two's complement.
The input range is restricted to signed 32-bit values so larger integers cannot silently wrap to a different bit pattern.
A mask has 1s in positions you want to inspect or preserve. AND clears every position where the mask contains 0.
For bit flags, testing value AND mask can reveal whether selected bits are set without modifying the original value.
Is this Boolean AND or bitwise AND?
It is a bitwise AND calculator. It applies the Boolean AND truth rule separately to each of 32 bit positions.
Can I enter negative integers?
Yes. Signed 32-bit negative values are represented with two's complement.
Why are inputs reset when I change base?
Decimal, binary, and hexadecimal are input modes. Resetting prevents text from the previous base from being silently reinterpreted in the new one.
Can I enter values larger than 32 bits?
No. This implementation deliberately restricts inputs to the signed 32-bit range because JavaScript bitwise operators coerce operands to 32-bit integers.
Related Tools