Use this operation to inspect or transform integer bit patterns in protocol fields, masks, flags, compact data structures, or programming exercises.

A

First operand.

B

Second operand.

Combine two integers with a bitwise AND on their 32-bit forms. The tool evaluates the supplied inputs together and returns the named outputs below; it does not infer omitted operating conditions or change the units shown.^[1]

Result

Bitwise AND of the two operands.

• JavaScript bitwise operators coerce values to signed 32-bit integers, and shift counts use only the low five bits. Decimal display can hide the two's-complement pattern, so inspect an unsigned or binary representation when individual bits matter.
• Use finite inputs in the displayed units and preserve more precision than the final presentation requires. Independently verify safety-critical, financial, compliance, or production decisions.

Use explicit masks and a documented bit width. For values wider than 32 bits, use a BigInt-based implementation or a byte-array tool instead of relying on JavaScript number bitwise coercion.

• Bitwise OR

  Combine two integers with a bitwise OR on their 32-bit forms.

• Bitwise XOR

  Combine two integers with a bitwise exclusive OR on their 32-bit forms.

• Bitwise Left Shift

  Shift an integer's 32-bit form left by the given number of bits.