🔢 Advanced Bitwise Calculator

What Are Bitwise Operations?

Bitwise operations work directly on the binary digits (bits) of numbers. Each bit is either 0 (off) or 1 (on). These operations are fast and directly supported by the processor, making them useful for various tasks like system programming, cryptography, and algorithm optimization.

Bitwise Operators

NOT

What it does: Flips each bit (0 becomes 1, and 1 becomes 0).

Example:

NOT 0111 (decimal 7)
1000 (decimal 8)

Use Case: Reversing masks or toggling states. For example, if you have a binary number 0110 and you want to flip all its bits, the result would be 1001.

AND

What it does: Returns 1 if both bits are 1; otherwise, it returns 0.

Example:

0101 (decimal 5)
AND 0011 (decimal 3)
0001 (decimal 1)

Use Case: Masking specific bits. For example, if you want to check if the second bit of a binary number 0110 is set (1), you can use a bitwise AND with 0010:

0110 AND 0010 = 0010
Since the result is non-zero, the second bit is set.

OR

What it does: Returns 1 if at least one bit is 1; otherwise, it returns 0.

Example:

0101 (decimal 5)
OR 0011 (decimal 3)
0111 (decimal 7)

Use Case: Combining flags/permissions. For example, if you have two flags represented by 0010 (second bit set) and 1000 (fourth bit set), you can combine them using OR:

0010 OR 1000 = 1010
The resulting binary number 1010 has both the second and fourth bits set.

XOR

What it does: Returns 1 if the bits are different; otherwise, it returns 0.

Example:

0101 (decimal 5)
XOR 0011 (decimal 3)
0110 (decimal 6)

Use Case: Encryption and error detection algorithms. For example, if you have a binary number 0110 and you want to toggle the second and fourth bits, you can use XOR with 1010:

0110 XOR 1010 = 1100
The resulting binary number 1100 has the second and fourth bits toggled.

How to Use the Calculator

1. Input Numbers: Enter the numbers in binary, decimal, or hexadecimal.
2. Select Operation: Choose the operation (AND, OR, XOR, NOT).
3. Calculate: Click to see the results in binary, decimal, and hexadecimal formats.

Examples

NOT

Input: 0111 (decimal 7)

Result: 1000 (decimal 8)

Explanation: Each bit in 0111 is flipped to get 1000.

AND

Input 1: 0101 (decimal 5)

Input 2: 0011 (decimal 3)

Result: 0001 (decimal 1)

Explanation:

0101 AND 0011
0001 (only the last bit is 1 in both numbers)

OR

Input 1: 0101 (decimal 5)

Input 2: 0011 (decimal 3)

Result: 0111 (decimal 7)

Explanation:

0101 OR 0011
0111 (at least one bit is 1 in each position)

XOR

Input 1: 0101 (decimal 5)

Input 2: 0011 (decimal 3)

Result: 0110 (decimal 6)

Explanation:

0101 XOR 0011
0110 (bits are different in the second and third positions)

Use Cases

• AND: Masking specific bits (e.g., checking if a number is even).Example: To check if a number is even, you can use AND with 0001 (binary for 1):

  0110 AND 0001 = 0000 (even)
  0111 AND 0001 = 0001 (odd)
  

• OR: Combining flags/permissions (e.g., read + write access).Example: Combining read (0001) and write (0010) permissions:

  0001 OR 0010 = 0011 (read and write)
  

• XOR: Encryption and error detection algorithms.Example: Toggling bits in a binary number:

  0110 XOR 1010 = 1100 (toggles the second and fourth bits)
  

• NOT: Reversing masks or toggling states.Example: Flipping all bits in a binary number:

  0110 NOT = 1001
  

Shift Operations

• Left Shift (<<): Shifts bits to the left, filling with 0.Example: 8 << 2 = 32 (binary: 00100000)Explanation: The binary number 00001000 (8) is shifted left by 2 positions, resulting in 00100000 (32).
• Right Shift (>>): Shifts bits to the right, filling with 0.Example: 8 >> 1 = 4 (binary: 00000100)Explanation: The binary number 00001000 (8) is shifted right by 1 position, resulting in 00000100 (4).

Key Features

• Supports binary, decimal, and hexadecimal inputs.
• Performs AND, OR, XOR, NOT, and shift operations.
• Displays results in multiple formats.