Perform AND, OR, XOR, NOT operations on binary numbers
Each bit of the output is 1 only if both corresponding input bits are 1. 1 & 1 = 1, everything else is 0.
Each bit of the output is 1 if at least one of the corresponding input bits is 1. 0 | 0 = 0, everything else is 1.
Each bit of the output is 1 if the corresponding input bits are different. 1 ^ 0 = 1, 1 ^ 1 = 0.
Flips every bit. Takes only one operand. In 32-bit signed integers, ~ flips all 32 bits, so ~00000000000000000000000000001010 = 11111111111111111111111111110101.
I have spent years writing low-level C code for embedded systems, and I can tell you that manually computing binary bitwise operations in your head gets exhausting fast. When you are debugging a state machine or verifying a hardware register mask, every bit matters — one flipped bit can mean the difference between a working interrupt handler and a silent system lockup. I built this binary bitwise calculator because I wanted a tool that shows me both the binary and decimal results side by side, with a visual bit alignment that makes it obvious which bits changed and how. Whether you are working on a microcontroller project, writing a device driver, or just learning how digital logic works at the transistor level, having an online binary bitwise calculator that handles AND, OR, XOR, and NOT operations saves you time and prevents the kind of off-by-one-bit errors that can cost hours of debugging.
The NOT operation deserves special attention because it trips up even experienced developers. JavaScript's bitwise NOT operator works on 32-bit signed integers, which means ~5 (binary 101) does not give you 010 — it gives you 11111111111111111111111111111010, or -6 in decimal. This is because the leading zero bits are included in the flip. My binary bitwise calculator handles this correctly by padding your input to 32 bits before applying NOT, and it shows you the result as both a signed decimal and an unsigned 32-bit binary value. I added this after burning an afternoon on exactly this issue while implementing a cyclic redundancy check algorithm. Understanding two's complement representation and sign extension is critical for anyone doing serious low-level programming, and a good binary bitwise calculator makes that visible instead of leaving you guessing.
Multi-base bitwise operations (hex, dec, oct, bin)
Convert hex strings to readable text
Base conversion with BigInt precision
Compute SHA-256 checksums instantly
AND outputs 1 only when both input bits are 1. OR outputs 1 when at least one input bit is 1. XOR (exclusive OR) outputs 1 when the input bits are different. Our binary bitwise calculator performs these operations bit-by-bit on your two binary numbers and shows the result in both binary and decimal formats with a visual bit alignment.
JavaScript's bitwise NOT operator works on 32-bit signed integers. When you apply NOT to a small binary number like 1010 (decimal 10), the leading 28 zero bits all flip to 1, producing 11111111111111111111111111110101, which is -11 in signed decimal. Our binary bitwise calculator shows both the signed decimal and the unsigned 32-bit binary representation so you can see exactly what is happening.
The binary bitwise calculator only accepts the digits 0 and 1. If you type any other character, a warning message appears and the calculation stops. Spaces are allowed and are automatically removed before processing.
Yes. For AND, OR, and XOR, the calculator aligns both numbers by their least significant bits and processes them at whatever length you enter. For NOT, the operation automatically pads to 32 bits following JavaScript's convention. You can enter any length from 1 to 64 bits.