Bitwise Calculator

They're interpreted as two's complement at the chosen width — for example −1 becomes all ones (0xFF at 8-bit). The signed column shows the two's-complement value of every result.

It masks results to that many bits, which matters for NOT and shifts. ~12 is 0xF3 at 8-bit but 0xFFFFFFF3 at 32-bit, just like a fixed-size integer in C or a CPU register.

Yes — use a 0x prefix for hex (0xFF), 0b for binary (0b1010) or 0o for octal. Plain decimal works too.

Yes. The calculator uses arbitrary-precision integers internally, so 64-bit operations don't lose precision the way 32-bit JavaScript bit operators would.

Logical — it shifts the unsigned pattern, so zeros come in from the left and the sign bit is not preserved. At 8-bit, A = −1 is 0xFF and A >> 1 is 0x7F, decimal 127, not −1. That matches JavaScript's >>> and Java's >>>, not their >>. If you need the arithmetic behaviour that C gives a signed int, shift the magnitude and re-apply the sign yourself, or read the signed column with that in mind.

Because JavaScript's << always truncates its operands to 32 bits regardless of the value, so 1 << 40 evaluates to 256 — 40 wraps to 8. Here the shift is done on arbitrary-precision integers and only then masked to the width you selected, so 1 << 40 at 64-bit is 1099511627776, which is what C gives on a uint64_t. Shifting by the width or more is defined here as producing 0, where C calls that undefined behaviour; the shift box is clamped to 0-64.