How long would it take to test all possible states of a 64x64x64 cube of bits?

Question

Imagining a solid cube of $64 \times 64 \times 64$ bits (each of which can have exactly two states), how long would it take to test all possible states of one of these? Let's also assume we're using the world's current most powerful supercomputer, which can perform 33.86 quadrillion math operations per second. (mind you, this means you have to account for how many basic operations a calculation takes up: $2\times3$ is one, $2\times\frac 1 3$ is two, etc.)

I tried asking Wolfram|Alpha, but it timed out: http://wolfr.am/1q6fxd9

I ask this question in the name of encryption security as well as randomization seeding uniqueness, and decided to ask it here instead of StackOverflow because it has more to do with math than computing.

Answer 1

There are $64^3 = 262144$ bits, so that there are only $2^{262144}$ possible cubes, which is around $10^{79000}$.

Thus, it's not very feasible to do any sort of computation involving looping over all possible cubes.

Answer 2

There are $2^{64\times 64\times 64}=2^{262144} $ possibilities, so at a rate of 33.86 quadrillion per second, it will take $\frac{2^{262144}}{33.86\times 10^{15}}$ seconds.