## Bitwise NAND Calculator

The bitwise calculator is a tool to perform NAND operation on numbers. The input can combine binary, decimal, hexadecimal, or octal numbers.

## How it Works?

To use this calculator, follow the below steps:

- Enter the number in the first input box.
- Select the NAND operator in the dropdown list.
- Enter the number in the second input box.
- You will see the calculated number in the output boxes for each base system
- The results is displayed as binary, decimal, hexadecimal, or octal numbers.

## NAND Truth Table

A NAND gate is made by inverting the output of an AND gate.

Truth Table
Input A |
Input B |
Output Q |

0 |
0 |
1 |

0 |
1 |
1 |

1 |
0 |
1 |

1 |
1 |
0 |

## Bitwise Operations

- A wide variety of programming languages supports bitwise operations on two integer integers.
- The evaluation and manipulation of particular bits within an integer are possible with bitwise operators.
- Each subsequent pair of bits in the operands is subjected to the operation.
- Bitwise AND, OR, and XOR are the three most popular operations.

## What is a Base System?

A base system is a mechanism of representing numbers. When we talk about base-n, the system can show a number with n characters (including 0). Numbers are represented by digits that are less than or equal to n. As a result, 3 in base-3 equals 10: because that system lacks a "3," it starts anew (1, 2, 10, 11, 12, 20, 21, 22, 100, etc.).

We commonly utilize base-10 since we have 10 (including 0) digits until we start anew (8,9,10). We only have two characters in base-2 (binary), 0 and 1, until we begin anew. In our (base-10) system, the binary number 10 is 2 in this example.

## JavaScript Bitwise Operators

Operator |
Name |
Description |

& |
AND |
Sets each bit to 1 if both bits are 1 |

| |
OR |
Sets each bit to 1 if one of two bits is 1 |

^ |
XOR |
Sets each bit to 1 if only one of two bits is 1 |

~ |
NOT |
Inverts all the bits |

<< |
Zero fill left shift |
Shifts left by pushing zeros in from the right and let the leftmost bits fall off |

>> |
Signed right shift |
Shifts right by pushing copies of the leftmost bit in from the left, and let the rightmost bits fall off |

>>> |
Zero fill right shift |
Shifts right by pushing zeros in from the left, and let the rightmost bits fall off |