SOLUTION: The product of 3 different prime numbers is always divisible by exactly _____ (how many) different non-prime numbers greater than 1?

Question 1139003: The product of 3 different prime numbers is always divisible by exactly _____ (how many) different non-prime numbers greater than 1?

Answer by ikleyn(52903) (Show Source): You can put this solution on YOUR website!
.

If  N = p*q*r  is the product of 3 prime numbers p, q and r, then

 
the divisors of N, that are not 1 or primes are  pq, pr, qr and the number N itself.


So, the answer is 4, equal to the cardinality of the set  {pq, pr, qr, N }.


ANSWER.  4.

RELATED QUESTIONS
561 is the product of 3 different prime numbers. How many factors of 561 are not... (answered by jim_thompson5910)

How many prime numbers are exactly divisible by... (answered by jim_thompson5910)

How many prime numbers are exactly divisible by... (answered by Fombitz,jim_thompson5910)

How many prime numbers are exactly divisible by... (answered by jim_thompson5910)

How many integers greater than 20 and less than 30 are each the product of exactly two... (answered by richwmiller)

What is the smallest number divisible by 4 different prime... (answered by solver91311)

what is the smallest number divisible by four different prime... (answered by Alan3354)

choose the number that is divisible by four different prime numbers 77, 105, 225, and... (answered by checkley77)

How many integers greater than 20 and less than 30 are each the product of exactly two... (answered by Edwin McCravy)