Question 909060
look at this as a prime factorization problem
let x be an integer with four prime factors, then we know that
x = a^p * b^q * c^r * d^s where a,b,c,d are prime factors and p,q,r,s are their powers, then 
The number of factors of x will be expressed by the formula (p+1)(q+1(r+1)(s+1). NOTE: this will include 1 and x itself.
We are told that x=abcd, where a, b, c, and d are four distinct prime numbers. According to the above the # of factors of x including 1 and x is (1+1)(1+1)(1+1)(1+1)=16. Excluding 1 and x the # of factors is 16-2=14.
This exercise assumes that each prime factor is distinct, this gives you an upper bound on the number of prime factors of x.