Logical shift right 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.
Unsigned division by powers of two
A logical right shift by n positions divides an unsigned integer by 2ⁿ, discarding the remainder. The high bits always fill with zeroes, so the sign bit is never preserved. For negative two’s complement values this produces a large positive result rather than a smaller negative one. Use arithmetic shift right when the sign must be preserved.
Fixed 32-bit word
The shift runs on a 32-bit unsigned word. 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, use the full Bitwise Calculator.