Bit Shift Calculator
The bit shift calculator lets you perform logical bit shift operations to the left and right on inputs from different numeral systems.
Result10110044 in decimal
Original101111
Equivalent to× 4exact
Bits used6
Hexadecimal2C
Shifting from 0 to 8 places
| n | Left binary | Left decimal | Right binary | Right decimal |
|---|---|---|---|---|
| 0 | 1011 | 11 | 1011 | 11 |
| 1 | 10110 | 22 | 101 | 5 |
| 2 | 101100 | 44 | 10 | 2 |
| 3 | 1011000 | 88 | 1 | 1 |
| 4 | 10110000 | 176 | 0 | 0 |
| 5 | 101100000 | 352 | 0 | 0 |
| 6 | 1011000000 | 704 | 0 | 0 |
| 7 | 10110000000 | 1,408 | 0 | 0 |
| 8 | 101100000000 | 2,816 | 0 | 0 |
The rule
a << n multiplies by 2ⁿ, a >> n divides by 2ⁿ
Shifting is fast multiplication
Moving every bit one place left doubles the value, exactly as moving a decimal digit left multiplies by ten. Shifting right halves it, discarding any remainder — so 7 >> 1 is 3, not 3.5. Compilers routinely replace multiplication and division by powers of two with shifts, because a shift costs a single cycle.