If you assume the complexity of an elements grows linearly with the number of states it can assume (e.g. if complexity of a bit is 2a then complexity of a trit is 3a). Then the total complexity of for example representing a number N is log{N}_{B} \times B \times a. Minimizing this with respect to B yields B=e.