Why does the NOT result look large and negative?

JavaScript bitwise NOT (~) flips all 32 bits of the two's complement representation, so ~0 becomes −1, ~1 becomes −2, and so on. The formula is ~n = -(n+1).

What is the difference between >> and >>>?

>> is a signed right shift that preserves the sign bit, so negative numbers stay negative. >>> is an unsigned right shift that fills the leftmost bits with 0, turning any negative number into a large positive 32-bit value.

What integer range is supported?

JavaScript bitwise operators work on 32-bit signed integers (−2 147 483 648 to 2 147 483 647). Values outside this range are truncated to 32 bits before computation, matching browser behavior exactly.

Can I enter hexadecimal or binary input?

Yes — prefix hex values with 0x (e.g. 0xFF) and binary values with 0b (e.g. 0b1010). The tool parses them the same way JavaScript does.

Why are shift amounts clamped to 0–31?

JavaScript masks the shift count to the lowest 5 bits (shift & 31), so shifts of 32 or more wrap around. This tool reflects that behavior exactly.

Bitwise Calculator

Name: Bitwise Calculator
Availability: InStock
Author: Nham Vu

Enter two integers and instantly see every JavaScript bitwise operation with full 32-bit binary breakdown.

Inputs

Operand A

Operand B (binary ops)

Quick examples

Operation

Decimal

32-bit Binary

A (operand)

—

B (operand)

—

Enter operands on the left to see results

Copied!

Summary

Enter two integers and instantly see every JavaScript bitwise operation with full 32-bit binary breakdown.

How it works

Enter a value for operand A (required) — any integer from −2 147 483 648 to 2 147 483 647.
Enter a value for operand B (required for binary operators, ignored for NOT).
The calculator instantly runs all seven JavaScript bitwise operations.
Each result row shows the operation symbol, result in decimal, and the full 32-bit binary representation.
Operands A and B are also shown in binary for easy visual comparison.

Use cases

Debug bitwise flag logic in JavaScript applications.
Learn how two's complement representation works for negative integers.
Quickly verify shift amounts and mask values during low-level coding.
Understand the difference between signed (>>) and unsigned (>>>) right shifts.
Generate bitmask results without opening a browser console.
Teach binary arithmetic in computer science courses.

Frequently Asked Questions

Last updated: 2026-06-09 · Reviewed by Nham Vu