Perform AND, OR, XOR, NOT, shifts, and rotations on binary, hex, or decimal values. Visualize bit patterns.
Takes up to two values in binary, hex, or decimal - or one value for NOT, shifts, and rotations - applies a bitwise operator bit by bit, and shows the result in every base plus a bit grid that lines each operand up by place value. You can trace which input bit produced which output bit. The usual surprise is NOT: it flips every bit, it is not negation. On 8 bits, NOT 0x0F is 0xF0, while negation of the same value is 0xF1, because two's complement is NOT plus 1. Width decides what NOT, shifts, and rotations return, so set it deliberately.
A concrete input and expected output from the current implementation.
Input
0xA5 XOR 0x5A
Expected output
0xFF (binary 11111111, decimal 255)
A5 hex is binary 10100101 and 5A is 01011010. XOR sets a bit only where the two operands differ; every position differs, so the result is 11111111, which is FF hex and 255 decimal.
Each operator is applied per position: AND leaves a bit set only where both operands have 1, OR where either does, XOR where exactly one does, NOT flips every bit. Operands align at the least significant bit; the shorter is zero-padded on the left (0b101 beside 0b11001 reads as 00101). Shifts push bits left or right and discard what falls off the end; rotations wrap it to the other side.
The base is read per operand: 0x or 0b prefixes mark hex and binary, plain digits read as decimal, and operands may mix bases. Inputs convert to one bit string; the result renders in all three bases at once - 42, 0x2A, and 0b101010 are the same value in three columns. The bit grid shows each operand as a row of cells by place value and the result row below.
A left shift moves every bit one position up and fills the bottom with 0, losing whatever falls off the top; a rotation moves the top bit around to the bottom instead of losing it. So 0b10000001 shifted left by 1 is 0b00000010, but rotated left by 1 it is 0b00000011 - the top 1 wraps to the low bit. Rotations preserve every bit; shifts discard.
Some bitwise calculators accept negative decimal input and convert it to two's complement at the working width; others only take non-negative values. If yours rejects the minus sign, enter the two's complement form yourself: at 8 bits, -5 is 0xFB, which also reads as 251 unsigned, so check the width before trusting either reading. Alternatively compute NOT 5 + 1, which is exactly two's complement negation.
The example and behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.