How many different Things can be represented by a Pow-bit binary sequence?
With 1 bit you can represent 2 different Things, by letting '0' represent the first Thing and '1' represent the second Thing.
With 2 bits you can represent 4 different Things, by letting '00', '01', '10', and '11' each represent a different Thing.
In general, with n bits you can represent 2 to the power of n (2^n) different things.
The answer is Math.pow(2,Pow)