# rotateRight

Rotates the binary representation of this Int number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:
`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of Int.SIZE_BITS (32) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 32)`

Rotates the binary representation of this Long number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:
`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of Long.SIZE_BITS (64) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 64)`

Rotates the binary representation of this Byte number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:
`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of Byte.SIZE_BITS (8) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 8)`

Rotates the binary representation of this Short number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of Short.SIZE_BITS (16) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 16)`

Rotates the binary representation of this UInt number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of UInt.SIZE_BITS (32) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 32)`

Rotates the binary representation of this ULong number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of ULong.SIZE_BITS (64) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 64)`

Rotates the binary representation of this UByte number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of UByte.SIZE_BITS (8) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 8)`

Rotates the binary representation of this UShort number right by the specified bitCount number of bits. The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.

`number.rotateRight(-n) == number.rotateLeft(n)`

Rotating by a multiple of UShort.SIZE_BITS (16) returns the same number, or more generally
`number.rotateRight(n) == number.rotateRight(n % 16)`