01 / 20

Factors, Multiples,
and Divisibility

Master divisibility rules and prime factorization to crack GMAT number-property problems with speed and confidence.

GMAT Quantitative Reasoning

The Core Vocabulary

Three words appear constantly on the GMAT. Getting them precisely right is the first step to fast, correct answers.

Factor (Divisor)
A number that divides evenly into another. \(3\) is a factor of \(12\).
Multiple
The result of multiplying by an integer. \(12\) is a multiple of \(3\).
Divisible
\(a\) is divisible by \(b\) if \(a \div b\) leaves remainder \(0\).

A Picture of the Relationship

Factor 3 Multiple 12 multiply by 4 divide by 4 12 is divisible by 3

Why This Matters on the GMAT

1
Speed. Divisibility rules let you check a number in seconds without long division.
2
Data Sufficiency. Many questions hinge on whether a value is divisible by a given number.
3
Counting factors. Prime factorization unlocks how many divisors a number has.
4
GCD and LCM. Both flow directly from prime factorizations.

The Essential Divisibility Rules

Divisor Test
2Last digit is even
3Sum of digits is divisible by \(3\)
4Last two digits divisible by \(4\)
5Last digit is \(0\) or \(5\)
6Divisible by both \(2\) and \(3\)
9Sum of digits is divisible by \(9\)
10Last digit is \(0\)

The Fundamental Theorem of Arithmetic

Every integer greater than \(1\) can be written as a product of primes in exactly one way (up to order).

72 8 9 2 4 2 2 3 3
\(72 = 2^3 \times 3^2\)

Counting the Number of Factors

If \(N = p_1^{a_1} \cdot p_2^{a_2} \cdots p_k^{a_k}\), the total number of positive factors is:

For \(72 = 2^3 \cdot 3^2\): exponents are \(3\) and \(2\), so the factor count is \((3+1)(2+1) = 4 \times 3 = 12\) factors.

GCD versus LCM

Both come from prime factorizations, but you pick different exponents.

GCD (Greatest Common Divisor) LCM (Least Common Multiple)
Which primesOnly shared primesAll primes that appear
Which exponentLowest powerHighest power
Result size\(\leq\) both numbers\(\geq\) both numbers

A Reliable Step-by-Step Method

1
Break it into primes. Factor each number completely into prime powers.
2
Identify the question. Counting factors? GCD? LCM? Divisibility test?
3
Apply the right tool. Use exponent formula, lowest/highest powers, or a digit rule.
4
Sanity check. Confirm size makes sense (GCD small, LCM large).

Worked Example: Divisibility Test

Is \(4{,}518\) divisible by \(6\)?

Worked Example: Counting Factors

How many positive factors does \(360\) have?

Worked Example: GCD and LCM

Find the GCD and LCM of \(48\) and \(60\).

Common Mistakes to Avoid

✕ Forgetting to add one
When counting factors, multiplying the exponents directly instead of \((a+1)(b+1)\).
✕ Swapping GCD and LCM
Using highest powers for GCD or lowest for LCM gives the wrong number.
✕ Treating 1 as prime
\(1\) is not prime. The smallest prime is \(2\).
✕ Missing zero remainder
Divisibility requires remainder \(0\), not just a small remainder.

Quick Reference Summary

Goal Tool
Check divisibilityDigit / last-digit rules
Count factors\((a_1+1)(a_2+1)\cdots\)
Greatest common divisorShared primes, lowest powers
Least common multipleAll primes, highest powers
Verify GCD/LCM\(\text{GCD}\times\text{LCM}=a\times b\)

Question 1 of 5

Which number is divisible by both \(3\) and \(4\)?

Question 2 of 5

How many positive factors does \(2^4 \cdot 3^2\) have?

Question 3 of 5

What is the GCD of \(36\) and \(48\)?

Question 4 of 5

What is the LCM of \(8\) and \(12\)?

Question 5 of 5

If \(N = 2^a \cdot 5^b\) has exactly \(12\) factors and \(a > b\), what are \(a\) and \(b\)?

You're Ready

You now have the full toolkit: divisibility rules for quick checks, prime factorization as your foundation, and clean formulas for counting factors, GCD, and LCM.