The property discovered by Pal Erdos alluded to in the above writeup is an easy consequence of the definition. In fact, we can show that any very composite number is of the form

N = 2^{k1}3^{k2}5^{k3}...

where k

_{1}≥k

_{2}≥...

Indeed, for any indices a < b, we have that

N' = 2^{k1}3^{k2}...p_{a}^{kb}...p_{b}^{ka}...

(i.e. what you get by switching the powers if p_{a} and p_{b} in N) has exactly the same number of

factors as does N. It follows from the definition that (if N is very composite) N ≤ N', so k

_{a} ≥ k

_{b}, as required.