What is the most efficient numerical base system?

I remember reading somewhere that base $e$ is the most “efficient” base system because of its ratio of possible characters to number length. For example, binary is “inefficient” because each represented number is very long when represented with only two digits (0 and 1). Base 10 is also considered “inefficient” because there are so many numbers to remember (0-9) even though each represented number is shorter than binary. Apparently the maximum “efficiency” occurs at base $e$. How is this possible? Can irrational bases exist? How is “efficiency” of a base numerically calculated?

Solutions Collecting From Web of "What is the most efficient numerical base system?"

First, let’s specify the sources. From Wikipedia:

The base $e$ is the most economical choice of radix $\beta > 1$ (Hayes 2001), where the radix economy is measured as the product of the radix and the length of the string of symbols needed to express a given range of values.

Then we have a longish article by Hayes in American Scientist, which I don’t feel like reading. The matter boils down to: the representation of number $n$ in base $\beta$ (integer or not) takes $\approx \log n/\log \beta$ digits. If your idea of “economy” is the product of this length with $\beta$ then of course, you are going to minimize
$\beta /\log \beta$ and find that the minimum is at $\beta=e$. For example, with Wolfram Alpha, which can plot this function and compute its derivative.

Assume there are V independent states of information, then we can present V/N digits in base N.

The amount of information we can represent: $I=N^{V/N}$

The value of N that makes I the maximum is the most “efficient” base

Natural log both sides:
lnI=(V/N)lnN

Take the derivative:
(lnI)’=V(1-lnN)/$N^2$

When lnI gets to an extreme, (lnI)’=0, i.e. N=e

Take the second derivative:
(lnI)”=V(2lnN-3)/$N^3$

When N=e, (lnI)”=$-1/N^3$, which is negative

Therefore, I reaches its maximum when N=e.