I imagine G.H. Hardy might be like: e is the unique base of a logarithm function, ln(n), so so that the average distance between prime numbers less than n, converges proportionally towards ln(n) - the ratio between ln(n) and the actual average distance between primes < n converges to 1 as n goes to infinity.