Is O(1) is correct complexity for bitwise operators(left shift ,right shift ,XOR and others) ?

Since we are touching each bit , is it O(n) or constance time since numbers of bits are constant on a machine ?

Is there good material to read this stuff ?