Factors, Divisors & Product Splitting
Deconstruct numbers into prime factors to calculate the total number of divisors, their sum, their product, and how to split numbers into paired factors.
1. The Story & Mental Model
Think of prime factorization as the DNA sequence of a number. Every integer is built from prime building blocks. The number , for example, is just .
When you want to build a divisor (a factor) of 360, you are basically walking through a buffet line of these prime blocks.
-
You arrive at the '2s' station. You can choose to take no 2s, one 2, two 2s, or three 2s. That's choices.
-
Next, the '3s' station. You can take no 3s, one 3, or two 3s. That's choices.
-
Finally, the '5s' station. You can take no 5s or one 5. That's choices.
Every unique combination makes a unique divisor! The total number of unique divisors is simply the product of your choices at each station: . This Combinatorics perspective turns abstract formulas into logical counting exercises.
2. The CAT Question Blueprint
The examiner will almost never ask "How many factors does 120 have?" That's too easy. Instead, they will:
-
Ask for the number of even or odd factors. (Constraining your choices at the '2s' station).
-
Ask for factors that are perfect squares or perfect cubes. (You can only pick powers that are multiples of 2 or 3).
-
Ask for the sum of the reciprocals of all factors.
-
Give you the total number of factors and ask you to reverse-engineer the minimum possible original number.
3. Core Concepts, Formulae & Derivations
Let the prime factorization of a number be:
A. Total Number of Factors (Divisors)
(Derived directly from the "buffet line" choices).
B. Sum of Factors
(This is the product of geometric progressions representing the sum of choices at each station).
C. Number of Odd vs. Even Factors
-
Odd Factors: Ignore the prime 2 completely. Calculate the total factors using only the odd prime bases.
-
Even Factors: Total Factors - Odd Factors. (Or, at the '2s' station, you cannot choose . You have choices instead of ).
D. Product of All Factors
(If , factors are 1, 2, 3, 4, 6, 12. Notice they form pairs that multiply to 12: , , . There are pairs).
(If is a perfect square, is odd, and the formula still holds valid!)
E. Expressing N as a Product of Two Factors
-
If is NOT a perfect square: Number of ways = .
-
If is a perfect square: Number of ways = if identical factors are allowed, or if identical factors are excluded.
4. Common Pitfalls & Speed Shortcuts
-
Pitfall: Applying the formulas without fully resolving the base numbers to primes. For example, treating directly. is not prime! You must write it as before applying any formula.
-
Shortcut: If a number has an odd number of factors, it MUST be a perfect square. If it has a prime number of factors (like exactly 3 factors), it must be the square of a prime number (e.g., , factors are 1, 5, 25).
Formulas
| Total Number of Factors | |
|---|---|
| Sum of Factors | |
| Product of Factors |
Traps and tips
- Before applying any formula, verify that all bases are strictly prime.
- A number with exactly 3 factors is always the square of a prime.
- For the sum of factors, if a prime power is small (like 2^2), it's faster to just add (1+2+4) instead of using the formula.
Solved examples
The Odd and Even Split
Find the total number of factors, the number of even factors, and the number of odd factors for .
Show solution
First, find the prime factorization of 1080.
.
1. Total Factors (T):
.
2. Odd Factors:
To make an odd factor, we cannot use any s. So we completely ignore .
We only look at .
Odd Factors = .
3. Even Factors:
Even Factors = Total Factors - Odd Factors = .
(Alternatively, for even factors, we must pick at least one 2. So we have 3 choices for the base 2 () instead of 4. ).
Takeaway: To find odd factors, completely drop the prime factor 2 and calculate normally.
Perfect Square Divisors
How many factors of are perfect squares?
Show solution
For a factor to be a perfect square, all its prime bases must have even exponents.
So, we can only choose even powers from our 'buffet'.
From , we can choose: . (3 choices)
From , we can choose: . (3 choices)
From , we can choose: . (2 choices)
Total perfect square factors = .
Takeaway: For perfect square factors, count only the even exponents available for each prime base (including 0).
Summing the Fragments
Calculate the sum of all factors of .
Show solution
First, factorize :
.
We use the sum of factors formula (or just sum the individual geometric progressions):
For base 2 (): .
For base 3 (): .
For base 5 (): .
Sum of all factors = Product of these sums.
.
Takeaway: The sum of factors is the product of the sums of all possible powers of each prime base.
The Product Phenomenon
What is the product of all factors of ?
Show solution
First, find the total number of factors () for .
.
Total factors .
Notice is odd, which makes sense because 144 is a perfect square.
The formula for the product of factors is .
.
To evaluate this, rewrite 144 as :
.
The product of all factors of 144 is .
Takeaway: The product of all factors is N^(T/2). If N is a perfect square, substitute N with x^2 to resolve the fractional exponent gracefully.
Reverse Engineering the Number
Find the smallest positive integer that has exactly 15 factors.
Show solution
We know the formula for total factors is
Here, .
We need to express 15 as a product of integers greater than 1.
The ways to write 15 are:
-
(a single prime base)
-
(two prime bases)
Let's test these cases to find the minimum .
Case 1:
This means , so .
The number is of the form .
To minimize , choose the smallest prime, .
.
Case 2:
This means and , so and .
The number is of the form .
To minimize , assign the largest exponent to the smallest prime.
So, and .
.
Comparing the two cases, is much smaller than .
The smallest number with exactly 15 factors is 144.
Takeaway: To find the smallest number with a given number of factors, factorize the factor count, assign the resulting exponents in decreasing order to primes in increasing order (2, 3, 5...).
Product Splitting
In how many ways can be expressed as a product of two co-prime factors?
Show solution
First, let's find the prime factorization of 1200.
.
For two factors and to be co-prime, they cannot share any common prime bases. .
This means all the s must go to either or . You cannot split the into and , otherwise they share a factor of 2.
Similarly, the must go entirely to or .
The must go entirely to or .
So, we have 3 distinct "prime blocks": , , .
For each block, we have 2 choices (put it in or put it in ).
Total arrangements = .
However, is the same as . The order of factors doesn't matter when expressing as a product of two factors.
So we divide by 2.
Ways = .
The 4 ways are:
Takeaway: The number of ways to express N as a product of two co-prime factors is 2^(k-1), where k is the number of distinct prime bases in N.
Practice questions
Question 1 · CAT Level
Let . How many positive divisors of are multiples of but not multiples of ?
Show answer and explanation
Answer: (B) 84
Any divisor has the form with , , , and .
For to be a multiple of , we require ( choices) and ( choices), giving divisors.
For to be a multiple of , we require ( choices), ( choices), and ( choices).
This gives multiples of .
Since every multiple of is automatically a multiple of , the required count is .
Question 2 · CAT Level
How many ordered pairs of non-zero integers satisfy the equation:
Show answer and explanation
Answer: (C) 29
Rearranging gives , which factors as .
Here , so the total number of positive divisors is .
For positive factors of , each divisor pair with gives valid non-zero positive solutions ( pairs).
For negative factors, gives and .
If , then , making undefined; all other negative factor pairs yield valid non-zero integers.
Thus, the total number of integer solutions is .
Question 3 · CAT Level
A positive integer has exactly factors, and has exactly factors. How many factors does have?
Show answer and explanation
Answer: (B) 45
Let the prime factorization of be .
The number of factors is , where .
Multiplying by increments the power of by , so .
Dividing the two equations gives .
Substituting into yields , which implies for some odd prime .
Then .
Hence, the number of factors of is .
Question 4 · CAT Level
Let be the set of all positive divisors of . How many ordered pairs of divisors are relatively prime (i.e., )?
Show answer and explanation
Answer: (C) 225
Factor . Any pair of divisors and satisfy if and only if for each prime.
For a prime with maximum power , the pair of exponents can be:
-
with ( choices),
-
with ( choices).
Thus, each prime provides independent choices.
Applying this product across all prime factors yields .
Therefore, there are exactly ordered pairs of co-prime divisors.
Question 5 · CAT Level
For how many positive integers is the sum of all positive divisors of , denoted , an odd integer?
Show answer and explanation
Answer: (C) 53
Let . The sum of divisors is .
The term is always odd for any integer .
For each odd prime , the geometric sum contains odd terms, which is odd if and only if is odd, meaning is even.
Thus, is odd if and only if all odd prime factors have even exponents, which occurs if and only if is either a perfect square or times a perfect square.
Case 1 (perfect square): ( values).
Case 2 ( square): ( values).
These two sets are disjoint (differing in parity of the power of ), giving a total of integers.
Study this concept with interactive practice in PrepSoc.
Open the concept library