Every divisibility relationship involves two numbers playing opposite roles. When 3∣12, the number 3 is a factor — it divides in. The number 12 is a multiple — it is divided into. Factors look downward, toward the smaller numbers that build a given integer. Multiples look upward, toward the infinite sequence of numbers that a given integer builds. Together they form the structural vocabulary of divisibility.
Key Terms
Divisor (Factor)— the central concept on this page; an integer that divides another exactly
Multiple— the counterpart to a factor, produced by multiplying out
Prime Number— an integer greater than 1 whose only factors are 1 and itself
Composite Number— an integer greater than 1 with additional factors beyond 1 and itself
24 chairs are to be set out in equal rows, with none left over. How many chairs can go in each row?
Some row sizes use up every chair; others leave a few standing at the side.
Rows of 3, 4, 6 or 8 use every chair; rows of 5 or 7 leave some over.
chairs per row
full rows
chairs left over
works?
3
8
0
yes
4
6
0
yes
5
4
4
no
6
4
0
yes
7
3
3
no
8
3
0
yes
Adding the trivial cases — one long row of 24, or 24 rows of one, and rows of 2 or 12 — the row sizes that work are 1,2,3,4,6,8,12 and 24.
A row size works exactly when 24 is that size times a whole number of rows.
Rows of 4 work because 24=4⋅6; rows of 5 fail because no whole number times 5 gives 24. Each working size comes with a partner, the number of rows: 3 and 8, 4 and 6.
The definition
A factor, or divisor, of n is an integer a such that n=a⋅k for some integer k; this is written a∣n.
A factor of n is any integer a such that a∣n — meaning n=a⋅k for some integer k. The terms "factor" and "divisor" are interchangeable.
So the factors of 24 are 1,2,3,4,6,8,12 and 24 — exactly the row sizes that work.
The factors of a number form a finite set, running from 1 up to the number itself.
Every integer greater than 1 has at least two factors: 1 and itself. The number 1 divides everything, and every number divides itself. Most numbers have additional factors between these two extremes.
The factors of 24 are 1,2,3,4,6,8,12,24 — eight in total. The factors of 13 are just 1 and 13 — making it prime.
Unlike multiples, which extend infinitely, the factor set of any positive integer is finite. No factor of n can exceed n itself (in absolute value), so the search space is bounded from the start.
Factors and multiples point in opposite directions: 4 is a factor of 24, and 24 is a multiple of 4.
The two words are easy to swap by mistake. The difference is set out side by side in factors vs multiples.
The rest of the page covers finding all factors, factor pairs, proper divisors, multiples, common factors and multiples, counting and summing factors, and divisor function notation.
Finding All Factors
A systematic search tests each integer from 1 up to n. If a divides n, both a and an are factors — a pair produced from a single test. Stopping at n is sufficient because if a>n, then an<n, and that smaller partner would already have been found.
For n=36, test integers from 1 to 6 (since 36=6):
Writing down only the successful test values 1,2,3,4,6 gives 36 just five factors. Each success a∣36 also gives the partner 36÷a, so 36, 18, 12 and 9 belong in the list too.
The complete factor set is {1,2,3,4,6,9,12,18,36} — nine factors, all discovered by testing only six candidates.
For large numbers, divisibility rules speed up the testing. Checking whether 2, 3, or 5 divide n takes a glance at the digits, not a full division.
Testing up to n is enough, because every successful test also yields the partner factor above the root.
Factor Pairs
RULE
Every factor a of n has a partner: an.
Together they satisfy a⋅an=n, and listing factor pairs ensures no divisor is overlooked.
For n=24, the pairs are: (1,24), (2,12), (3,8), (4,6). Each pair multiplies to 24, and together they account for all eight factors.
Pitfall: Counting the square root twice
Counting two factors for every pair gives 16 six factors from (1,16), (2,8) and (4,4). The pair (4,4) holds only one factor, so 16 has five: 1,2,4,8,16.
For perfect squares, one pair collapses into a repeated value. The number 36 has the pair (6,6) — the square root paired with itself. This is why perfect squares have an odd number of factors: every other factor appears in a pair of two distinct values, but the square root stands alone.
Organizing factors into pairs is more reliable than listing them individually. Starting from (1,n) and working inward, each successful division test produces two factors at once — halving the work and providing a built-in completeness check.
Proper Divisors
The proper divisors of n are all of its factors except n itself. They are the numbers that divide n without being equal to it.
The proper divisors of 12 are {1,2,3,4,6}. The number 12 itself is excluded.
Pitfall: Counting the number among its proper divisors
Adding 28 to its own proper divisors gives 1+2+4+7+14+28=56>28, so 28 looks abundant. Without 28 the sum is 1+2+4+7+14=28, and 28 is perfect.
Proper divisors define three classical categories. A number is perfect if the sum of its proper divisors equals the number: 6=1+2+3, so 6 is perfect. A number is abundant if the sum exceeds it: the proper divisors of 12 sum to 1+2+3+4+6=16>12. A number is deficient if the sum falls short: the proper divisors of 10 sum to 1+2+5=8<10.
Perfect numbers are rare. The first four are 6,28,496, and 8,128. Every known perfect number is even, and whether an odd perfect number exists remains one of the oldest unsolved problems in mathematics.
A number and its proper divisorscompare the sum of the proper divisors with the number
Perfect
The sum of its proper divisors equals the number.
6=1+2+3
Abundant
The sum exceeds the number.
12: 1+2+3+4+6=16>12
Deficient
The sum falls short of the number.
10: 1+2+5=8<10
Perfect numbers are rareThe first four are 6,28,496 and 8,128. Every known perfect number is even.
Proper DivisorsLearn Math Class
Multiples
A multiple of a is any number b such that a∣b — meaning b=a⋅k for some integer k. Where factors divide into a number, multiples are produced by multiplying out from it.
The multiples of 7 are 7,14,21,28,35,42,… — an infinite sequence with no largest member.
RULE
Every positive integer generates infinitely many multiples.
Zero is a multiple of every number, since 0=a⋅0 for any a. It sits at the start of every multiple sequence, though it is often omitted when listing "the multiples of a" in contexts where only positive values are relevant.
The modulo operation identifies which multiple of n is closest to a given number a without exceeding it: a=n⋅q+r, where n⋅q is that nearest multiple and r is the gap between it and a.
The ÷3 column: the multiples of 3 marked down the table
Reading down the highlighted column, every third number is marked as divisible by 3: those marks are the multiples 3, 6, 9, 12, … produced by multiplying 3 out, an endless sequence spaced 3 apart. The factors of a number are finite; its multiples never stop. Pick any divisor column and read its multiples on the interactive divisibility table.
Common multiples, treated below, are the rows where two such columns are marked at once.
Factors vs Multiples
The two concepts are inverses of each other, and mixing them up is one of the most common errors in elementary number theory.
Factors go downward. The factors of 24 are 1,2,3,4,6,8,12,24 — all less than or equal to 24. There are finitely many of them.
Multiples go upward. The multiples of 24 are 24,48,72,96,… — all greater than or equal to 24 (excluding zero). There are infinitely many.
The contrast is easiest to read on two adjacent number lines, with 24 itself as the pivot between them:
The relationship is symmetric: a is a factor of b if and only if b is a multiple of a. The number 3 is a factor of 12, and 12 is a multiple of 3. Same fact, opposite viewpoints.
A useful mnemonic: factors fit into a number (they are smaller), multiples multiply out from a number (they are larger). The factor set is contained; the multiple set is unbounded.
A common factor of two numbers m and n is a number that divides both. Finding common factors means intersecting the two factor sets.
Example
The factors of 12 are {1,2,3,4,6,12}. The factors of 18 are {1,2,3,6,9,18}. The common factors — numbers appearing in both sets — are {1,2,3,6}.
Every pair of positive integers shares at least one common factor: 1 divides both, always. The question is whether they share anything larger.
The greatest common factor is the largest member of the common factor set. For 12 and 18, it is 6. This value — the GCD — plays a central role in simplifying fractions, solving equations, and determining whether two numbers are coprime.
Common Multiples
A common multiple of two numbers m and n is a number divisible by both. Where common factors are drawn from finite sets, common multiples form an infinite sequence.
Example
The multiples of 4 are 4,8,12,16,20,24,28,32,36,… The multiples of 6 are 6,12,18,24,30,36,… The common multiples are 12,24,36,48,… — every value that appears in both lists.
Pitfall: Multiplying to get the LCM
Taking 6⋅8=48 as the smallest common multiple of 6 and 8 skips 24, which both divide: 24=6⋅4=8⋅3. The product is the least common multiple only when the two numbers share no factor except 1, as 4 and 9 do.
The smallest positive common multiple is the LCM. For 4 and 6, it is 12. Every other common multiple is a multiple of the LCM: 24=2⋅12, 36=3⋅12, and so on.
Common multiples arise naturally in problems involving synchronization. If one event repeats every 4 days and another every 6 days, they coincide every 12 days — the LCM of their periods.
Common multiples never run out, and every one of them is a multiple of the LCM.
Counting Factors
For small numbers, counting factors by listing them is practical. For larger numbers, prime factorization provides a formula.
If n=p1a1⋅p2a2⋯pkak, the number of positive divisors of n is:
Counting Factors
(a1+1)(a2+1)⋯(ak+1)
Pitfall: Multiplying the exponents
Counting the factors of 12=22⋅3 as 2⋅1=2 misses most of them. Adding 1 to each exponent gives (2+1)(1+1)=6, the factors 1,2,3,4,6,12.
Each prime factor pi can appear in a divisor 0,1,2,…,ai times — that is ai+1 independent choices. The total number of divisors is the product of all these choices.
Example
The number 72=23⋅32 has (3+1)(2+1)=12 factors. Listing them confirms: 1,2,3,4,6,8,9,12,18,24,36,72 — exactly twelve.
Pitfall: Counting with factors that are not prime
Reading 36=4⋅9 as two factors with exponent 1 gives (1+1)(1+1)=4, but 36 has 9 factors. The formula needs primes: 36=22⋅32 gives (2+1)(2+1)=9.
The formula reveals structure that raw listing obscures. A number with many small prime factors has more divisors than a number of similar size with fewer, larger prime factors. The number 60=22⋅3⋅5 has 12 factors, while 64=26 has only 7.
The same idea says how to build a number with many factors and keep it small: use the smallest primes, and give the larger exponents to the smaller primes. Swapping two exponents so that the larger one sits on the smaller prime keeps the factor count and makes the number smaller: 2⋅32=18 and 22⋅3=12 both have 6 factors.
Fact: 720720 has 240 factors
720720=24⋅32⋅5⋅7⋅11⋅13 has (4+1)(2+1)(1+1)4=240 factors, and no smaller number has as many. It is also the smallest number divisible by every whole number from 1 to 16.
A number with more factors than every smaller number is called highly composite. The first few are 1,2,4,6,12,24,36,48,60,120, each of them built from the smallest primes with exponents that never increase from one prime to the next. The number 60, for example, is the smallest number with 12 factors. Srinivasa Ramanujan studied these numbers in a long paper published in 1915.
The number of factors is set by the exponents in the prime factorization, not by the size of the number.
Sum of Factors
The sum of all positive divisors of n is denoted σ(n). Like the divisor count, it can be computed directly from the prime factorization.
Example
For n=12: the divisors are 1,2,3,4,6,12, and σ(12)=1+2+3+4+6+12=28.
Fact: Every even perfect number has one shape
When 2p−1 is prime, n=2p−1(2p−1) is perfect, since σ(n)=(2p−1)⋅2p=2n; this gives 6, 28, 496 and 8,128. Euclid proved this around 300 BC, and about 2,000 years later Euler showed that every even perfect number has this shape.
Example
For n=6: the divisors are 1,2,3,6, and σ(6)=1+2+3+6=12. The sum of all divisors is twice the number — but more revealing is that the sum of the proper divisors is 1+2+3=6, equal to n itself. This makes 6 a perfect number.
The next perfect number, 28=22⋅7, has the same shape as 6=2⋅3: a power of 2 times an odd prime. For a number 2k⋅q of this shape, the divisors are the powers 1,2,…,2k together with those same powers times q, so σ(2kq)=(1+2+⋯+2k)(1+q)=(2k+1−1)(q+1). For 28 this gives 7⋅8=56=2⋅28.
The relationship between σ(n) and n classifies every positive integer. When σ(n)−n=n, the number is perfect. When σ(n)−n>n, it is abundant. When σ(n)−n<n, it is deficient. Most numbers are deficient; abundance and perfection are the exceptions.
The divisor-structure toolkit runs on three marks: the prime-power template every formula reads from, the two names of the counting function this page computes anonymously, and the sigma that sums.
The canonical-factorization template: p reserved for primes, subscripts enumerating the distinct ones, exponents counting repeats — 72=23⋅32 filled in. Every divisor formula on this page reads its data off this shape.
CasesThe subscript does the enumeration job of root labels, conventionally ascending p1<p2<⋯; an absent prime is exponent zero, which is exactly how the (ai+1) choice-counts of Counting Factors above work.
Do not confuseAn equation to solve. The template states a shape — nothing multiplies until a concrete n arrives; treating p1a1 as unknowns misreads a description as a problem.
d(n) · τ(n)
d of n; tau of n — the divisor count
The names the counting formula answers to: (a1+1)⋯(ak+1) of Counting Factors above computes d(n) — written τ(n) in number-theory texts. This page leaves the function anonymous; the literature does not.
Casesd(72)=12, τ(64)=7 — one function, two dialects: d in elementary writing, τ in research papers, alongside σ's family below.
Do not confuseA differential. The letter d is mathematics' most overloaded — differentials own dx; here d(n) is an ordinary function value, its parentheses the only shield.
σ(n)
sigma of n — the sum of divisors
Lowercase sigma as a named function: σ(n) sums every positive divisor — σ(12)=28, per Sum of Factors above. The perfect/abundant/deficient classification is written entirely in σ(n)−n comparisons.
CasesProper-divisor sums drop n itself — σ(n)−n, sometimes named s(n), the aliquot sum; perfect numbers are exactly the solutions of σ(n)=2n.
Same glyph elsewhereThe letter's other careers: capital Σ is the summation operator — kindred in spirit, different in grammar — and lowercase σ names singular values and standard deviations elsewhere; the argument (n) marks the divisor-sum reading.
Arithmetic Notation at a Glance·/arithmeticLearn Math Class
Worked Examples
Find all factors of 48. Test from 1 to 48≈6.9: 1∣48 (pair 1,48), 2∣48 (pair 2,24), 3∣48 (pair 3,16), 4∣48 (pair 4,12), 5∤48, 6∣48 (pair 6,8). Factors: {1,2,3,4,6,8,12,16,24,48} — ten in total.
List the first 8 multiples of 9: 9,18,27,36,45,54,63,72.
Find the common factors of 30 and 45. Factors of 30: {1,2,3,5,6,10,15,30}. Factors of 45: {1,3,5,9,15,45}. Common: {1,3,5,15}. The GCD is 15.
Count the factors of 180=22⋅32⋅5. Formula: (2+1)(2+1)(1+1)=18 factors.
Is 28 perfect? Proper divisors: 1,2,4,7,14. Sum: 1+2+4+7+14=28. Yes — 28 is the second perfect number.
Is 20 abundant or deficient? Proper divisors: 1,2,4,5,10. Sum: 22>20. Abundant.
Summary: A Toolkit for Divisor Structure
Every question this page addresses about a number n — what its factors are, how many it has, how it compares to similar numbers, what it shares with another integer — reduces to one of a small set of recurring tools. The table below collects those tools in one place, paired with a worked example so each row stands as both a reference and a reminder of how to apply it.
intersect the factor sets; the largest is gcd(m, n)
12 ∩ 18 in factors → {1, 2, 3, 6}; gcd = 6
Find common multiples with m
the smallest is lcm(m, n); every common multiple is a multiple of it
4 and 6: lcm = 12; common multiples are 12, 24, 36, 48, …
Summary: A Toolkit for Divisor StructureLearn Math Class
Common Pitfalls
Seven mistakes account for many of the wrong answers about factors and multiples. Six are marked where they happen in the sections above; the mix-up between factors and multiples is the one Factors vs Multiples already warns about. Here each is worked through in full, with the wrong and the right working side by side.
The pair search tests candidates only up to n. Each test that succeeds is written down, but its partner an is not, so the list stops at n and misses every factor above it.
Start
For n=36,
Wrong turn
Error here
The tests for 1,2,3,4,6 succeed, so the factors of 36 are 1,2,3,4,6, five in total.
Right path
Each success gives a pair: (1,36), (2,18), (3,12), (4,9), (6,6). The factors are 1,2,3,4,6,9,12,18,36, nine in total.
Why it happensThe rule "test up to n" is read as the end of the list, when it is only the halfway mark of the search.
How to checkThe largest factor of n is n itself. A list of the factors of 36 that does not end in 36 is incomplete.
2Counting the square root twice
Every factor pair is counted as two factors, including the pair in which the square root of a perfect square meets itself.
Wrong turn
Error here
16 has the pairs (1,16), (2,8) and (4,4), so it has 3⋅2=6 factors.
Right path
The pair (4,4) contributes the single factor 4. The factors of 16 are 1,2,4,8,16, five in total. In the same way 36 has 9 factors, not 10.
Why it happensFor a number that is not a perfect square every pair really holds two different factors, so "two per pair" becomes a habit.
How to checkA perfect square has an odd number of factors, so an even count for 16, 36 or 100 means the root was counted twice. The counting formula agrees: 16=24 has 4+1=5 factors.
3Counting the number among its proper divisors
When a number is classified as perfect, abundant or deficient, the number itself is added to the sum of its proper divisors. The sum then always exceeds n, and every number looks abundant.
Wrong turn
Error here
For 28, 1+2+4+7+14+28=56>28, so 28 is abundant.
Right path
The proper divisors leave out 28 itself. Their sum is 1+2+4+7+14=28, equal to the number, so 28 is perfect.
Why it happensThe full list of divisors ends with n, and the sum σ(n) in Sum of Factors includes it. The word "proper" is the only signal to drop it.
How to checkWith n included, the sum of the divisors of any n>1 is at least n+1, so if every number tested comes out abundant, n was counted. When the full sum σ(n) is used, compare it with 2n, not with n: σ(28)=56=2⋅28.
4Mixing up factors and multiples
The two words for the two sides of a∣b are swapped, so the numbers that go into n are listed as its multiples, or the numbers it goes into as its factors.
Wrong turn
Error here
The multiples of 12 are 1,2,3,4,6,12.
Right path
Those are the factors of 12, the numbers that divide it. The multiples of 12 are 12⋅1,12⋅2,12⋅3,…, that is 12,24,36,48,…
Why it happensBoth words come from the same multiplication fact. 12=3⋅4 makes 3 a factor of 12 and 12 a multiple of 3, and which side each word belongs to has to be remembered.
How to checkCompare sizes and count. A positive factor of n is at most n and there are finitely many; a positive multiple of n is at least n and the list never ends.
5Multiplying to get the LCM
The product of two numbers is taken as their smallest common multiple.
Wrong turn
Error here
The least common multiple of 6 and 8 is 6⋅8=48.
Right path
The multiples of 6 are 6,12,18,24,… and the multiples of 8 are 8,16,24,…, and the first one they share is 24. The product 48=2⋅24 is a common multiple, but not the smallest.
Why it happensThe product is always a common multiple, and when the two numbers share no factor except 1, as 4 and 9 do, it is the least one, 36. The shortcut works often enough to seem like a rule.
How to checkIf the two numbers share a factor d>1, the product divided by d is still a common multiple. Both 6 and 8 are even, and 48÷2=24 is divisible by both: 24=6⋅4=8⋅3.
6Multiplying the exponents
In the factor-count formula the added 1s are dropped, and the exponents of the prime factorization are multiplied as they stand.
Wrong turn
Error here
12=22⋅3 has exponents 2 and 1, so it has 2⋅1=2 factors.
Right path
An exponent ai allows ai+1 choices, from 0 to ai copies of its prime. So 12 has (2+1)(1+1)=6 factors: 1,2,3,4,6,12.
Why it happensThe exponent counts the copies of a prime that are present, and the choice of taking none of them, which gives the factors without that prime, is easy to overlook.
How to checkTry a prime power. The factors of 8=23 are 1,2,4,8, four of them, which is 3+1 and not 3. For 72=23⋅32, multiplying the exponents gives 6, while Counting Factors lists 12.
7Counting with factors that are not prime
The counting formula is applied to a factorization whose bases are not all prime.
Wrong turn
Error here
36=4⋅9, two bases with exponent 1, so 36 has (1+1)(1+1)=4 factors.
Right path
Break each base down to primes first. 4=22 and 9=32, so 36=22⋅32 and it has (2+1)(2+1)=9 factors: 1,2,3,4,6,9,12,18,36.
Why it happens4⋅9 is a true factorization, and the formula looks as if it reads any exponents. It counts correctly only with primes; built from 4 and 9 alone, the factors 2, 3, 6, 12 and 18 never appear.
How to checkEvery base must be prime before the formula is used. The pair search also catches it: 36 has the pairs (1,36), (2,18), (3,12), (4,9), (6,6), far more than four factors.
All seven slips miscount or misname factors. Each factor found below the square root has a partner above it, a square root pairs with itself and counts once, the proper divisors leave out the number itself, a factor is at most n while a multiple is at least n, the LCM divides the product by the GCD, and the counting formula (a1+1)(a2+1)⋯ needs every base to be prime. Checking that the list ends in n itself, comparing sizes, or trying a prime power such as 8=23 catches each of them.
Skills You Should Learn
Each skill opens its step-by-step method page.
Arithmetic methods
Find the GCD by prime factorizationFactor both numbers into primes and keep the shared primes with the smaller exponent: gcd(72,120)=23⋅3=24.
Find the least common multipleFind the smallest number that two or more numbers divide: take every prime with its larger exponent, or use lcm(a,b)=gcd(a,b)a⋅b.
Test divisibility by 2Single ruleYou need to know whether a whole number is even, for example before halving it or factoring out a 2: 1,746, 3,821, 90,318.
Test divisibility by 3Single ruleYou want to know whether 3 divides a number without dividing it: 729, 1,234, 5,832.
Test divisibility by 5Single ruleYou want to know whether 5 divides a number, for example while factoring or simplifying a fraction: 4,835, 7,832, 990.
A perfect number equals the sum of its proper divisors. The number 6 is perfect: 1 + 2 + 3 = 6. The number 28 is perfect: 1 + 2 + 4 + 7 + 14 = 28. Perfect numbers are rare — the first four are 6, 28, 496, and 8128.Read more →
Why do perfect squares have an odd number of factors?
+
Factors come in pairs (a, n/a) that multiply to n. For perfect squares, the square root pairs with itself (√n, √n), counting as one factor instead of two. All other pairs contribute two factors, so the total is odd. That is why 36 has nine factors: 1, 2, 3, 4, 6, 9, 12, 18, 36.Read more →
What are abundant and deficient numbers?
+
Classify a number by the sum of its proper divisors (all factors except the number itself). If the sum exceeds the number, it is abundant: 20 gives 1+2+4+5+10 = 22 > 20. If the sum falls short, it is deficient: 16 gives 1+2+4+8 = 15 < 16. If the sum lands exactly, the number is perfect. List any number's divisors with the divisibility calculator.Read more →
Is every perfect number even?
+
No one knows. Every perfect number found so far is even, and whether an odd one exists is one of the oldest unsolved problems in mathematics. The even ones are fully understood: Euclid showed that 2p−1(2p−1) is perfect whenever 2p−1 is prime, which gives 6, 28, 496 and 8,128, and Euler proved that every even perfect number has this shape.Read more →
What is a highly composite number?
+
A number with more factors than every smaller number. The first few are 1,2,4,6,12,24,36,48,60,120. Each uses the smallest primes, with exponents that never increase from one prime to the next, since moving a larger exponent onto a smaller prime keeps the factor count and makes the number smaller. 720720=24⋅32⋅5⋅7⋅11⋅13 has 240 factors, more than any smaller number. Ramanujan studied them in 1915.Read more →
Is zero a multiple of every number?
+
Yes. Zero equals a⋅0 for every integer a, so it meets the definition of a multiple of a exactly and stands at the start of every list of multiples: 0,7,14,21,… for 7. Lists of multiples often leave it out because only positive values are wanted. For the same reason the least common multiple is defined as the smallest positive common multiple; otherwise every LCM would be 0.Read more →