How does mod of power of 2 work on only lower order bits of a binary number ( 1011000111011010 )? What is this number mod 2 to power 0, 2 to power 4? What does power of 2 have to do with the modulo operator? Does it hold a special property? Can someone give me an example? The instructor says "When you take something mod to power of 2 you just take its lower order bits". I was too afraid to ask what he meant =)

Mod of power 2 on bitwise operators?

How does mod of power of 2 work on only lower order bits of a binary number (1011000111011010)?
What is this number mod 2 to power 0, 2 to power 4?
What does power of 2 have to do with the modulo operator? Does it hold a special property?
Can someone give me an example?

The instructor says "When you take something mod to power of 2 you just take its lower order bits". I was too afraid to ask what he meant =)