It’ll be useless as you can’t compute decimal digits, only hexadecimal (i.e. also binary). Anyway, other algorithms could be used to calculate the digits at runtime instead of storing them.
I think the Bailey–Borwein–Plouffe formula works like this (though I’ve now found a faster formula):
The equation tells you pi is a (infinite) sum of various numbers of powers of 16 (which appear as reciprocal, that means the digits come after the decimal point) – i.e. it consists of hexadecimal digits going on forever. k tells you the specific digit, so by substituting k for whatever you get the specific digit, without having to know the previous digits (they don’t appear anywhere in the equation). E.g. k = 0 gives you 1/160 = 1 (whole units) and the number in the rounded brackets will get you 47/15 = 3.1333, which tells you there are 3 whole units in pi, i.e. pi starts with 3 (which is the same in decimal as well as hexadecimal). Substituting 1 should give you the next digit after the decimal point (not sure if it’s called decimal point if it’s hexadecimal number ) etc.