Faster finding of all cubic numbers
There's no reason to use brute force like that.  I couldn't even get the program to complete without crashing.

To find the count, just take the cube root of n, and round down.  Then, it's a simple matter to construct the list you need.

n = 9238899039
count = int(n ** (1.0/3))
store = range(1, count + 1)