The bitwise calculator is a tool to perform Bit Shift operation on numbers. The input can combine binary, decimal, hexadecimal, or octal numbers.
To use this calculator, follow the below steps:
The left shift operator is a binary operator which shifts some number of bits, in the given bit pattern, to the left and appends 0 at the end. The left shift is equivalent to multiplying the bit pattern with 2k ( if we are shifting k bits ).
The right shift operator is a binary operator which shifts some number of bits, in the given bit pattern, to the right and appends 1 at the end. The right shift is equivalent to dividing the bit pattern with 2k ( if we are shifting k bits ).
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.
|&||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|
UNIX is simple. It just takes a genius to understand its simplicity.Dennis Ritchie