# Binary right-shifter

## World's simplest binary tool

Free online binary right-shifter. Just load your binary values and their bits will automatically get shifted to the right. There are no ads, popups or nonsense, just an awesome bit shifter. Load bits – get right-shifted bits. Created for developers by developers from team Browserling.
Announcement Check out our new project!
We just launched a new site – Online GIF Tools – a collection of tools for working with GIFs. Check it out!
Bit Shifting Type
Insert zero bits at the beginning.
Copy the most-significant bit at the beginning.
Right-shift this number of bits.
Bit Shifting Mode
Add as many bits to the beginning as you want.
Preserve the length of input numbers.
Truncate shifted number from the right to length k.
Enter k here – truncation length.
Shifted Number Formatting
Use a binary base prefix or suffix indicator.
Binary right-shifter tool What is a binary right-shifter?
This tool shifts binary numbers to the right side. It moves bits of a binary number by a certain number of positions to the right and adds new bits on the left. There are two types of right bit shift: Logical Shift and Arithmetic Shift. In left-shift these operations are the same but in right-shift they are different. The logical right-shift always adds zeros at the beginning of a number. The arithmetic right-shift copies the most-significant bit (MSB) and adds it to the beginning of a number. The MSB can be either a zero or a one. For both types, you can also choose a shift mode that controls the shift behavior. The unlimited mode simply adds the given number of bits at the leaves the original bits unchanged. For example, if the input number is 11010 and shift-length is 2, then the output is 0011010 in logical shift and 1111010 in arithmetic shift. The self-length mode, also known as the constant-length mode keeps the original length of the input number. It deletes as many bits from the end of the binary as it adds at the start, leaving the total length unchanged. For example, if the input number is, again 11010 and the shift-length is, again 2, then the output is 00110 in logical shift and 11110 in arithmetic shift. The truncate mode shortens the binary numbers from the right side to the specified length (k). For example, if the input number is 11010, the shift width is 2, and cut length k is 4, then the output is 0011 in logical shift and 1111 in arithmetic shift. You can also extend the length of output binary numbers by using signed and unsigned padding. The signed padding will use 1-bits and the unsigned padding will use 0-bits. Additionally, you can decorate the shifted bytes with the binary base prefix or postfix. Something super cool about right-shifting is that shifting a number one position to the right is the same as dividing it by 2. Similarly, right-shift by n is the same as dividing it by 2n. Simple and easy!
Binary right-shifter examples Click to use
Logical Right Shift
In this example, we operate on six binary numbers using the logical right-shift type and unlimited shift mode. We set the shift width to 3 and as a result, all digits in each number are moved to the right by three positions and empty places at the beginning are filled with zeros. The word "unlimited" here means that you could shift the numbers by 900 positions and it would still work.
0101 1010 1111 10100 11001 11110
0000101 0001010 0001111 00010100 00011001 00011110
Required options
These options will be used automatically if you select this example.
Insert zero bits at the beginning.
Right-shift this number of bits.
Add as many bits to the beginning as you want.
Use a binary base prefix or suffix indicator.
Arithmetic Right Shift
This example applies the arithmetic right shift method to several different six-digit binary numbers. As the shift length is set to 2, it moves the first two bits to the right and fills the empty positions on the left with copies of the most-significant bit (MSB). In the first, second, and fourth numbers, the MSB is equal to one, and in all other numbers, it's equal to zero. It also adds a lowercase binary number indicator "0b" to the output.
111111 111000 000111 110011 001100
0b111111 0b111110 0b000001 0b111100 0b000011
Required options
These options will be used automatically if you select this example.
Copy the most-significant bit at the beginning.
Right-shift this number of bits.
Preserve the length of input numbers.
Use a binary base prefix or suffix indicator.
This example also performs an arithmetic shift but uses the truncation mode. In this case, the numbers are first shifted one position to the right, then the most-significant bit is duplicated at the beginning, and then numbers get truncated from the right side to 6 characters. After all this, the numbers are sign-padded to a full byte (8 positions) and the suffix "B" is added.
1010101 0101010 111 00110 011 101110111
11110101B 11001010B 11111111B 11000110B 11110011B 11110111B
Required options
These options will be used automatically if you select this example.
Copy the most-significant bit at the beginning.
Right-shift this number of bits.
Truncate shifted number from the right to length k.
Enter k here – truncation length.
Use a binary base prefix or suffix indicator.
Pro tips Master online binary tools
You can pass input to this tool via ?input query argument and it will automatically compute output. Here's how to type it in your browser's address bar. Click to try!
All binary tools
Didn't find the tool you were looking for? Let us know what tool we are missing and we'll build it!
Quickly convert ASCII characters to binary numbers.
Quickly convert binary numbers to ASCII characters.
Quickly convert UTF8 characters to binary bits.
Quickly convert binary bits to UTF8 characters.
Quickly generate random binary values.
Quickly create an image from a binary number.
Quickly convert binary numbers to octal numbers.
Quickly convert octal numbers to binary numbers.
Quickly convert binary numbers to decimal numbers.
Quickly convert decimal numbers to binary numbers.
Quickly convert binary numbers to hexadecimal numbers.
Quickly convert hexadecimal numbers to binary numbers.
Quickly convert octal values to BCD values.
Quickly convert BCD values to octal values.
Quickly convert decimal values to BCD values.
Quickly convert BCD values to decimal values.
Quickly convert hex values to BCD values.
Quickly convert BCD values to hex values.
Quickly convert a string to binary values.
Quickly convert binary values to a string.
Quickly convert binary numbers to reflected binary numbers.
Quickly convert reflected binary numbers to binary numbers.
Quickly convert octal numbers to reflected binary numbers.
Quickly convert reflected binary numbers to octal numbers.
Quickly convert decimal numbers to reflected binary numbers.
Quickly convert reflected binary numbers to decimal numbers.
Quickly convert hexadecimal numbers to Gray code.
Quickly convert Gray code to hexadecimal numbers.
Quickly calculate the sum of a bunch of binary values.
Quickly calculate the difference of a bunch of binary values.
Quickly calculate the product of a bunch of binary values.
Quickly convert a negative number to a binary representation.
Quickly convert a negative binary number to a decimal number.
Quickly convert base 2 numbers to base -2.
Quickly calculate bitwise AND of a bunch of binary values.
Quickly calculate bitwise NAND of a bunch of binary values.
Quickly calculate bitwise OR of a bunch of binary values.
Quickly calculate bitwise NOR of a bunch of binary values.
Quickly calculate bitwise XOR of a bunch of binary values.
Quickly calculate bitwise XNOR of a bunch of binary values.
Quickly calculate bitwise NOT of a bunch of binary values.
Quickly find the number of high bits in binary values.
Quickly find the number of low bits in binary values.
Quickly invert bits of binary numbers.
Quickly reverse the order of bits in binary numbers.
Quickly convert plain text to binary values.
Quickly convert binary numbers to plain text.
Quickly randomize the order of bits in binary numbers.
Quickly rotate bits in binary numbers to the left or right.
Quickly shift bits of a binary number to the left.
Quickly shift bits of a binary number to the right.
Coming soon These binary tools are on the way
Create a File from Binary Values
Convert binary numbers to a binary file.
Binary Dump a File
Create a binary dump of files in your browser.
Convert Binary to Arbitrary Base
Convert binary values to any base (up to base 64).
Convert Binary to Roman Number
Convert binary numbers to Roman numerals.
Convert Roman Number to Binary
Convert Roman numerals to binary values.
Generate a Binary Sequence
Create a list of increasing of decreasing binary numbers.
Binary Sheffer Stroke
Calculate bitwise sheffer stroke operator of binary values.
Convert Binary to BCD
Encode every binary bit as a binary coded decimal.
Convert BCD to Binary
Decode binary coded decimals to binary bits.
Divide Binary Numbers
Perform division operation on several binary numbers.
Rotate a Binary Right
Rotate bits of a binary number to the right.
Rotate a Binary Left
Rotate bits of a binary number to the left.
Extract Bits from Binary Numbers
Extract n-th bit from a binary number.
Calculate Parity
Count parity of a binary number.
Convert EBCDIC to Binary
Convert EBCDIC characters to binary values.
Convert Binary to EBCDIC
Convert binary bits to EBCDIC symbols.
Swap Binary Endianness
Change endianness of a binary number.
Convert Little Endian Binary to Big Endian Binary
Convert a binary number from little endian to big endian.
Convert Big Endian Binary to Little Endian Binary
Convert a binary number from big endian to little endian.
Convert a Floating Point Number to Binary
Find the binary representation of a floating point number.
Convert Binary Values to a Bitmap
Convert a binary string to a bitmap image.
Convert a Bitmap to Binary Numbers
Convert a bitmap image to zeros and ones.
Split Binary Values
Split a binary number into smaller binary numbers.
Join Binary Values
Join multiple smaller binary numbers into a single binary.
Slice Binary Values
Extract a part of a binary number.