Earlier quoted context omitted.
I think what made me think of it in the first place was the representation of the largest known primes ( http://primes.utm.edu/largest.html#biggest ) The current largest prime is (2^57885161)-1, which is 17,425,170 digits, yet can be represented with much less, obviously. Maybe adding exponents would help. aX^n + b, perhaps?
(this is the point where I hope hope HOPE everyone in this thread is joking)
Well, I did represent that record prime number, which would take 7,235,646 bytes to write to disk, in 14 bytes, so it's either joking or sorcery.