On highly factorable numbers (Q1273199)

Let \(f(n)\) denote the number of essentially different factorizations of \(n\), where all factors exceed 1. Then \(n\) is said to be highly factorable if \(f(m)< f(n)\) for all \(m\) such that \(1\leq m< n\). The author proves a conjecture of Canfield, Erdős, and Pomerance regarding the exponents in the prime factorization of a large highly factorable number.