Left Shift Calculator - Bitwise Left Shift (<<) Online

Left Shift Calculator

The Left Shift Calculator performs a bitwise left shift operation on a binary or decimal number. Enter a number and the number of positions to shift, and instantly see the result. This free online tool is ideal for programmers, digital electronics engineers, computer science students, and embedded systems developers.

Left shift is one of the most efficient operations in programming — shifting a number left by N positions multiplies it by 2ᴺ, and is used extensively in fast multiplication, bit manipulation, and low-level data processing.

0001 shift left 1 → 0010  (1 × 2 = 2)
0001 shift left 2 → 0100  (1 × 4 = 4)
0011 shift left 2 → 1100  (3 × 4 = 12)
1010 shift left 1 → 10100 (10 × 2 = 20)

What is a Left Shift?

A left shift (logical left shift) is a bitwise operation that moves every bit of a number N positions to the left. Bits shifted off the left end (MSB side) are discarded, and zeros are inserted at the right end (LSB side). For unsigned integers, left shifting by N positions is equivalent to multiplying by 2ᴺ.

How to Perform Left Shift

1. Write the binary representation of the number.
2. Move all bits N positions to the left.
3. Append N zeros to the right side of the number.
4. The result is the left-shifted binary value.

Left Shift Formula

Result = Number × 2ᴺ

In binary: append N zeros to the right

Example: 0011 shift left 2

→ 001100 = 12 (decimal)

Left Shift Examples

Applications of Left Shift

• Fast Multiplication by Powers of 2
• Bit Field Packing and Manipulation
• Hash Function Computation
• Image Processing and Color Channels
• Embedded Systems Register Configuration
• Network Protocol Header Encoding
• Arithmetic in ALUs

Programming Examples

Python

3 << 2

Output

12

JavaScript

3 << 2

Output

12

C

int result = 3 << 2;  // result = 12

Frequently Asked Questions