If n is a product of k distinct primes what is the total number of factors of n ?

Explanation

n is a product of k distinct primes.
`:.` In order to be a factor, of n, we have choose at least one of k distinct primes.
`:.` The number of ways. `= ""^kC_1+ ""^kC_2 + ……….. ""^kC_(k-1) =2^k-1-1`
`:. "The number of factors of n is "2^k-2`.
(Excluding 1 as 1 is not prime . It is also not include n.)