Bitwise XNOR Calculator

Operand A

Operand B

expression

0x000000F0 XNOR 0x0000000F = 0xFFFFFF00

32-bit result

1111 1111 1111 1111 1111 1111 0000 0000

Unsigned decimal

4294967040

Hexadecimal

0xFFFFFF00

Octal

0o37777777400

Go to the full Bitwise Calculator

Bitwise XNOR calculator

Apply XNOR to two integers and read the result as unsigned decimal, hexadecimal, octal, and 32-bit padded binary. XNOR computes XOR on both 32-bit words and then inverts every bit, producing 1 in every position where the operands match.

Bit-level equality

XNOR is a direct equality test per bit. If operand A and operand B are identical, every bit in the result is 1 and the unsigned decimal output is 4294967295 (0xFFFFFFFF). If they differ in every bit, the result is 0. Partial matches produce an intermediate pattern where only the matching positions are 1.

Fixed 32-bit word

The inversion step makes the word size critical. This page fixes the word at 32 bits, so all results reflect a 32-bit unsigned NOT applied after XOR. Input accepts decimal, hexadecimal (0xFF), binary (0b10110010), and octal (0o377) automatically. For a different word size, use the full Bitwise Calculator.

Frequently Asked Questions

What does XNOR compute?

XNOR (Exclusive NOR) returns 1 only if both bits are identical (both 0 or both 1). It is essentially an equality check at the bit level.

Is XNOR the exact opposite of XOR?

Yes. XNOR flips every bit of an XOR result. While XOR returns 1 where bits differ, XNOR returns 1 where bits match.

How is XNOR used in digital circuits?

It is frequently used in hardware comparators to determine if two binary numbers are identical. A single XNOR of two words produces all-ones when the words are equal.