Binary Right Shift Calculator
Use the free Binary Right Shift Calculator to move a binary number right by any number of positions. A logical right shift removes bits from the right side; for a non-negative unsigned integer, shifting right by n positions corresponds to integer division by 2ⁿ.
What Is a Binary Right Shift?
A binary right shift moves the bits of a binary value toward lower place values. In an unsigned logical right shift, bits removed from the right side are discarded.
The operation is commonly written with the >> symbol.
For example, shifting 101100 right by two positions gives
1011.
Bits move right
Each shift moves the existing significant bits one position toward a lower power of two.
Rightmost bits are removed
Bits that pass beyond the least-significant side no longer contribute to the unsigned result.
How to Calculate a Binary Right Shift
For example, begin with 101100.
Decide how many positions the bits should move toward the right.
Each shift lowers the binary place value of the remaining significant bits.
Any bit moved beyond the least-significant position is removed.
If all significant bits are removed, the numerical result is zero.
Worked Example: 101100 >> 2
Start with binary 101100, which represents decimal 44.
Binary 1011 equals decimal 11, which agrees with integer division:
44 divided by 4 equals 11.
Binary Right Shift Examples
| Binary Number | Shift | Result |
|---|---|---|
101 |
0 | 101 |
1010 |
1 | 101 |
101100 |
1 | 10110 |
101100 |
2 | 1011 |
1110000 |
3 | 1110 |
100000 |
5 | 1 |
100000 |
6 | 0 |
Why Right Shift Divides by Powers of Two
For a non-negative unsigned integer, moving every bit one position to the right corresponds to integer division by 2. Two positions correspond to division by 4, while three positions correspond to division by 8.
The floor operation matters whenever the original value is not exactly divisible by the corresponding power of two.
2ⁿ.
Right Shift by One Position
One right shift removes the lowest binary position and divides a non-negative unsigned value by 2 using integer division.
Right Shift by Two Positions
A two-position logical right shift removes the two rightmost positions and corresponds to unsigned integer division by 4.
Right Shift by Three Positions
112 / 8 = 14
1110₂ = 14₁₀
What Happens When You Shift Right by 0?
A shift count of zero means no movement occurs. Therefore the result is the same binary value.
What Happens If the Shift Is Larger Than the Binary Length?
When an unsigned value is shifted far enough that all significant bits leave the right side, its numerical result becomes zero.
1011 >> 5 = 0
BinaryCon therefore displays 0 rather than an empty result when
the complete bit pattern has been shifted away.
Right Shift and Odd Binary Numbers
An unsigned right shift performs integer division, so a fractional remainder is discarded.
The discarded least-significant bit corresponds to the lost remainder.
Why the Rightmost Bits Matter
The rightmost bit is the least significant bit. It represents
2⁰, or decimal 1. The next bit represents 2¹,
or decimal 2.
When bits are shifted out from the right side, their contribution is discarded from the resulting integer value.
Logical Right Shift vs Arithmetic Right Shift
This distinction is especially important when working with signed integers. A logical right shift normally introduces zeros from the left, while an arithmetic right shift can preserve the sign bit for a signed value.
Logical right shift
Treats the value as an unsigned bit pattern and brings zeros into newly opened high-order positions.
Arithmetic right shift
Often copies the sign bit into new high-order positions so a signed two’s-complement value keeps its sign.
Right Shift vs Left Shift
| Operation | Direction | Unsigned Numeric Effect |
|---|---|---|
| Left Shift | Bits move left | Multiply by powers of 2 when no overflow occurs |
| Right Shift | Bits move right | Integer divide by powers of 2 |
Can Left Shift Undo a Right Shift?
Not always. A right shift can permanently discard bits from the right side. Once those bits are removed, simply shifting left cannot reconstruct them.
The result is 1010, not the original 1011, because
the last 1 was discarded during the right shift.
Right Shift in Programming
Bitwise right-shift operators are common in programming languages, but their exact behavior can depend on the language, integer representation, signedness, and operand width.
44 >> 2 = 11
44 >> 3 = 5
The final example gives 5 because 44 divided by 8 equals 5.5 and the discarded low-order bits remove the remainder.
Where Is Binary Right Shift Used?
Bit Extraction
Move a selected group of higher-order bits toward the low-order positions before applying a mask.
Packed Data
Extract fields stored within larger binary or integer structures.
Embedded Systems
Read selected hardware-register fields and reposition control bits.
Powers-of-Two Division
For unsigned values, shifting provides the binary equivalent of integer division by powers of two.
Encoding and Decoding
Move packed fields into useful positions before conversion or interpretation.
Computer Science Learning
Study bit positions, integer division, binary representation, and low-level data manipulation.
Using Right Shift with a Bitmask
Right shift and AND are often combined when extracting a field from a packed binary value.
A mask can then isolate only the positions required by a particular data format or program.
Leading Zeros and Right Shift
Leading zeros do not change the unsigned numerical value of a binary number. They can, however, be useful when showing a fixed-width representation.
This calculator accepts the entered bit pattern and performs the right shift
directly on it. The displayed result represents the remaining binary sequence,
with a result of 0 when all bits have been removed.
Common Binary Right Shift Mistakes
A right shift moves bits toward the least-significant side, not toward the left.
Appending zeros on the right describes a left shift. A right shift discards bits from the right side.
Unsigned right shifting does not retain fractions or remainders.
Signed arithmetic right shifts can preserve a sign bit, while this calculator uses unsigned logical behavior.
Once a right shift discards low-order bits, the information contained in them is lost.
Related BinaryCon Tools
Continue with other shift, mask, and bitwise calculators.
Binary Right Shift Calculator FAQs
What is a binary right shift?
What does >> mean?
>> notation commonly represents a right-shift operation
in programming and bitwise calculations.
What is 101100 >> 1?
What is 101100 >> 2?
What is 1110000 >> 3?
What happens when I right shift by zero?
Does right shift divide a number by 2?
What does right shift by 2 divide by?
2² = 4.
What does right shift by 3 divide by?
What is the right-shift formula?
x >> n = floor(x / 2ⁿ).
Why does right shifting an odd number lose information?
What happens if I shift farther than the number’s length?
Is right shift always reversible?
What is the difference between logical and arithmetic right shift?
Does BinaryCon perform signed arithmetic right shift?
Do leading zeros change a right-shift value?
Can BinaryCon shift long binary numbers?
How is right shift used with bitmasks?
Calculate Binary Right Shift Instantly
Use BinaryCon to shift binary values right, understand integer division by powers of two, extract bit fields, compare logical and arithmetic shifts, and verify your calculations with clear worked examples.