I assume you mean i instead of r ...
<<n means "left shift by n * bits". Since you start with 1 = binary 00 ... 00001, if you shift left 4 times, you get binary 00 ... 10000 = 16 (this helps if you are familiar with binary arithmetic - otherwise "calc.exe" has a binary converter )
Each bit moves n places to the left, filling (on the right) with 0s. * = note that n is actually "mod 32" for int , therefore (as an angular case) 1 <33 = 2, not 0, which you can expect.
There is also >> (right shift) that moves to the right, filling in 0 for uint and + ve int s, and 1 for -ve int s.
source share