TXT · Text & Data tools

Shift Left Calculator

Operand A
Operand B / shift count
expression

0x000000F0 SHL 0x0000000F = 0x00780000

32-bit result

0000 0000 0111 1000 0000 0000 0000 0000

Unsigned decimal
7864320
Hexadecimal
0x00780000
Octal
0o00036000000
Go to the full Bitwise Calculator

Shift left calculator

Enter the base value as operand A and the shift count as operand B. The result shows as unsigned decimal, hexadecimal, octal, and 32-bit padded binary. Both values are treated as 32-bit words.

Multiplication by powers of two

Shifting left by one position doubles the value, provided no bits overflow the word. Shifting left by n positions multiplies the value by 2ⁿ as long as the result fits within 32 bits. Compilers and CPUs often substitute a left shift for multiplication when the multiplier is an exact power of two.

Fixed 32-bit word

The shift runs on a 32-bit unsigned word. Bits shifted past position 31 are lost and the low end fills with zeroes. Operand A accepts decimal, hexadecimal (0xFF), binary (0b10110010), and octal (0o377) automatically. Operand B must be a non-negative integer. For a different word size or signed output, use the full Bitwise Calculator.

Frequently Asked Questions

In a fixed-width 32-bit word, bits shifted past position 31 are discarded. Shifting any value left by 32 or more positions produces zero.

A shift by 0 leaves the number exactly as it is. In dynamic languages it is sometimes used to coerce a value to an exact 32-bit integer.

In signed two's complement interpretation, yes. Shifting a 1 into bit 31 sets the sign bit, which makes the value negative under signed rules. This page shows unsigned output by default; use the full Bitwise Calculator for signed display.

Specific bitwise operations

Full Bitwise Calculator tool

Explore Our Tools

Browse all tools