Notice that
By the Euclidean Algorithm,

Thus, the prime factors of and are distinct. Notice that using the same factorization , we can simplify to
and are prime, and the rest of the factors that make up have at least one prime each, there are at least distinct prime factors in . Since we have shown that the prime factors of and are distinct, there are at least 21 prime factors in the original expression.