Question

Difficulty: HardFactors, Multiples, and Prime Factorization

A positive integer NN has exactly 1515 positive factors and is divisible by 66. If NN has exactly two distinct prime factors, what is the sum of all possible values of NN that are less than 500500?

  1. A
    144
  2. B
    324
  3. 468Answer
  4. D
    540

Answer

The sum of all possible values of N less than 500 is 468.
For a number N=pa×qbN = p^a \times q^b to have 15 factors, (a+1)(b+1)=15(a+1)(b+1) = 15. The factor pairs of 15 for two prime factors are (5,3)(5, 3) and (3,5)(3, 5), which correspond to exponent pairs (4,2)(4, 2) and (2,4)(2, 4). Since NN is divisible by 6, its prime factors are 2 and 3. Computing both cases gives 24×32=1442^4 \times 3^2 = 144 and 22×34=3242^2 \times 3^4 = 324. Both are less than 500, making their sum 144+324=468144 + 324 = 468.

Step-by-Step Solution

1
Determine the prime factors of N
N has prime factors 2 and 3
Since N is divisible by 6, it must have at least 2 and 3 as prime factors. The problem states N has exactly two distinct prime factors, so its prime factorization is of the form N=2a×3bN = 2^a \times 3^b.
2
Apply the total factors formula
(a+1)(b+1)=15(a + 1)(b + 1) = 15
The total number of positive factors of N=pa×qbN = p^a \times q^b is given by (a+1)(b+1)=15(a + 1)(b + 1) = 15.
3
Find valid non-negative integer pairs (a, b)
Either (a=4,b=2)(a=4, b=2) or (a=2,b=4)(a=2, b=4)
Since 15 factors into 5×35 \times 3 or 3×53 \times 5 (note that 15×115 \times 1 would imply only one prime factor, which contradicts having two distinct prime factors), the possible exponent pairs are (4,2)(4, 2) and (2,4)(2, 4).
4
Calculate the values of N and check bounds
N1=24×32=144N_1 = 2^4 \times 3^2 = 144 and N2=22×34=324N_2 = 2^2 \times 3^4 = 324
Both 144<500144 < 500 and 324<500324 < 500 meet all conditions.
5
Sum the valid values of N
144+324=468144 + 324 = 468
Adding the two valid integers yields the total sum.

Key Concept

Factors and Prime Factorization Exponent Rule
Rate this question