Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Factors and Multiples






The Two Sides of Divisibility

Every divisibility relationship involves two numbers playing opposite roles. When 3∣123 \mid 12, the number 33 is a factor — it divides in. The number 1212 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
Prime Factorization— decomposition into primes, used here to count divisors

See All Arithmetic Definitions →


Factors (Divisors)

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 rowfull rowschairs left overworks?
380yes
460yes
544no
640yes
733no
830yes
Adding the trivial cases — one long row of 2424, or 2424 rows of one, and rows of 22 or 1212 — the row sizes that work are 1,2,3,4,6,8,121, 2, 3, 4, 6, 8, 12 and 2424.
A row size works exactly when 24 is that size times a whole number of rows.
Rows of 44 work because 24=4⋅624 = 4 \cdot 6; rows of 55 fail because no whole number times 55 gives 2424. Each working size comes with a partner, the number of rows: 33 and 88, 44 and 66.
The definition
A factor, or divisor, of nn is an integer aa such that n=a⋅kn = a \cdot k for some integer kk; this is written a∣na \mid n.
A factor of nn is any integer aa such that a∣na \mid n — meaning n=a⋅kn = a \cdot k for some integer kk. The terms "factor" and "divisor" are interchangeable.
So the factors of 2424 are 1,2,3,4,6,8,121, 2, 3, 4, 6, 8, 12 and 2424 — 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 11 has at least two factors: 11 and itself. The number 11 divides everything, and every number divides itself. Most numbers have additional factors between these two extremes.
The factors of 2424 are 1,2,3,4,6,8,12,241, 2, 3, 4, 6, 8, 12, 24 — eight in total. The factors of 1313 are just 11 and 1313 — making it prime.
Factor set (single)factors of 241234681224factors of 24{1, 2, 3, 4, 6, 8, 12, 24}8 factors total
Unlike multiples, which extend infinitely, the factor set of any positive integer is finite. No factor of nn can exceed nn 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 11 up to n\sqrt{n}. If aa divides nn, both aa and na\frac{n}{a} are factors — a pair produced from a single test. Stopping at n\sqrt{n} is sufficient because if a>na > \sqrt{n}, then na<n\frac{n}{a} < \sqrt{n}, and that smaller partner would already have been found.

For n=36n = 36, test integers from 11 to 66 (since 36=6\sqrt{36} = 6):

1∣361 \mid 36: pair (1,36)(1, 36). 2∣362 \mid 36: pair (2,18)(2, 18). 3∣363 \mid 36: pair (3,12)(3, 12). 4∣364 \mid 36: pair (4,9)(4, 9). 5∤365 \nmid 36: skip. 6∣366 \mid 36: pair (6,6)(6, 6).

To list all factors of a specific number, use the factoring calculator.
The search of this section on 36. Press Next to carry out one step at a time and watch the pairs collect.
DownloadPNG2×PDF
n=36n = 36, n=6\sqrt{n} = 6Step 1 of 20
Values now
aa =11pair =–
This step
Begin the search at a=1a = 1. It will stop after a=6a = 6.
Algorithm
1Start with a=1a = 1
2Test whether aa divides nn
3If it does, record the pair aa and na\frac{n}{a}
4Increase aa by 11 and repeat until a>na > \sqrt{n}
5The recorded pairs hold every factor of nn
Tests finished so far
aadivides 3636?pair
111yes(1,36)(1, 36)
222yes(2,18)(2, 18)
333yes(3,12)(3, 12)
444yes(4,9)(4, 9)
555noskip
666yes(6,6)(6, 6)
Result
The factor search as a loop·/arithmetic/divisibility/factorsLearn Math Class
Factor pairsfactors of 36 — found by testing 1 to √36 = 61 · 36 = 362 · 18 = 363 · 12 = 364 · 9 = 366 · 6123469121836√36 = 6stop testing herepairs by testing 1 → √36(1, 36), (2, 18), (3, 12),(4, 9), (6, 6)6 tests → 9 factors
Pitfall: Forgetting the partner factors
Writing down only the successful test values 1,2,3,4,61, 2, 3, 4, 6 gives 3636 just five factors. Each success a∣36a \mid 36 also gives the partner 36÷a36 \div a, so 3636, 1818, 1212 and 99 belong in the list too.

The complete factor set is {1,2,3,4,6,9,12,18,36}\{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 22, 33, or 55 divide nn takes a glance at the digits, not a full division.
Testing up to n\sqrt{n} is enough, because every successful test also yields the partner factor above the root.

Factor Pairs

RULE
Every factor aa of nn has a partner: na\frac{n}{a}.

Together they satisfy a⋅na=na \cdot \frac{n}{a} = n, and listing factor pairs ensures no divisor is overlooked.

For n=24n = 24, the pairs are: (1,24)(1, 24), (2,12)(2, 12), (3,8)(3, 8), (4,6)(4, 6). Each pair multiplies to 2424, and together they account for all eight factors.
Factor pairsfactors of 24 — found by testing 1 to √24 ≈ 4.901 · 24 = 242 · 12 = 243 · 8 = 244 · 6 = 241234681224factor pairs of 24(1, 24), (2, 12),(3, 8), (4, 6)each pair multiplies to 24
Pitfall: Counting the square root twice
Counting two factors for every pair gives 1616 six factors from (1,16)(1, 16), (2,8)(2, 8) and (4,4)(4, 4). The pair (4,4)(4, 4) holds only one factor, so 1616 has five: 1,2,4,8,161, 2, 4, 8, 16.

For perfect squares, one pair collapses into a repeated value. The number 3636 has the pair (6,6)(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)(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 nn are all of its factors except nn itself. They are the numbers that divide nn without being equal to it.

The proper divisors of 1212 are {1,2,3,4,6}\{1, 2, 3, 4, 6\}. The number 1212 itself is excluded.
Factor set (single)factors of 121234612sum = 16 > 12 (abundant)proper divisors of 12{1, 2, 3, 4, 6}1+2+3+4+6 = 1616 > 12 → abundant
Pitfall: Counting the number among its proper divisors
Adding 2828 to its own proper divisors gives 1+2+4+7+14+28=56>281 + 2 + 4 + 7 + 14 + 28 = 56 > 28, so 2828 looks abundant. Without 2828 the sum is 1+2+4+7+14=281 + 2 + 4 + 7 + 14 = 28, and 2828 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+36 = 1 + 2 + 3, so 66 is perfect. A number is abundant if the sum exceeds it: the proper divisors of 1212 sum to 1+2+3+4+6=16>121 + 2 + 3 + 4 + 6 = 16 > 12. A number is deficient if the sum falls short: the proper divisors of 1010 sum to 1+2+5=8<101 + 2 + 5 = 8 < 10.

Perfect numbers are rare. The first four are 6,28,4966, 28, 496, and 8,1288{,}128. Every known perfect number is even, and whether an odd perfect number exists remains one of the oldest unsolved problems in mathematics.
DownloadPNG2×PDF
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+36 = 1 + 2 + 3
Abundant
The sum exceeds the number.
1212: 1+2+3+4+6=16>121 + 2 + 3 + 4 + 6 = 16 > 12
Deficient
The sum falls short of the number.
1010: 1+2+5=8<101 + 2 + 5 = 8 < 10
Perfect numbers are rareThe first four are 6,28,4966, 28, 496 and 8,1288{,}128. Every known perfect number is even.
Proper DivisorsLearn Math Class

Multiples

A multiple of aa is any number bb such that a∣ba \mid b — meaning b=a⋅kb = a \cdot k for some integer kk. Where factors divide into a number, multiples are produced by multiplying out from it.

The multiples of 77 are 7,14,21,28,35,42,…7, 14, 21, 28, 35, 42, \ldots — an infinite sequence with no largest member.

RULE
Every positive integer generates infinitely many multiples.
Number line scene (single track)0714212835424956…multiples of 77, 14, 21, 28, 35,42, 49, 56, …Infinitely many.
Zero is a multiple of every number, since 0=a⋅00 = a \cdot 0 for any aa. It sits at the start of every multiple sequence, though it is often omitted when listing "the multiples of aa" in contexts where only positive values are relevant.

The modulo operation identifies which multiple of nn is closest to a given number aa without exceeding it: a=n⋅q+ra = n \cdot q + r, where n⋅qn \cdot q is that nearest multiple and rr is the gap between it and aa.
÷1÷2÷3÷4÷5÷6÷7÷8÷9÷10÷11÷12✕0123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
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 2424 are 1,2,3,4,6,8,12,241, 2, 3, 4, 6, 8, 12, 24 — all less than or equal to 2424. There are finitely many of them.

Multiples go upward. The multiples of 2424 are 24,48,72,96,…24, 48, 72, 96, \ldots — all greater than or equal to 2424 (excluding zero). There are infinitely many.

The contrast is easiest to read on two adjacent number lines, with 2424 itself as the pivot between them:
Split view (factors vs multiples)factors of 241234681224multiples of 2424487296120…factors vs multiplesfactors of 24:1, 2, 3, 4, 6, 8, 12, 248 values, finitemultiples of 24:24, 48, 72, 96, …infinitely many24 is the pivot — largest factor, smallest multiple.
The relationship is symmetric: aa is a factor of bb if and only if bb is a multiple of aa. The number 33 is a factor of 1212, and 1212 is a multiple of 33. 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.
DownloadPNG2×PDF
Layout
AspectFactors of nMultiples of n
Definitionintegers a such that a ∣ nintegers b such that n ∣ b
Directiondownward — each is ≤ nupward — each positive multiple is ≥ n
Cardinalityfiniteinfinite
Example for n = 12{1, 2, 3, 4, 6, 12}12, 24, 36, 48, 60, …
Factors vs MultiplesLearn Math Class

Common Factors

A common factor of two numbers mm and nn is a number that divides both. Finding common factors means intersecting the two factor sets.

Example
The factors of 1212 are {1,2,3,4,6,12}\{1, 2, 3, 4, 6, 12\}. The factors of 1818 are {1,2,3,6,9,18}\{1, 2, 3, 6, 9, 18\}. The common factors — numbers appearing in both sets — are {1,2,3,6}\{1, 2, 3, 6\}.
Common factors of two numbersfactors of 121234612factors of 181236918gcd(12, 18) = 6largest common factorcommon factors{1, 2, 3, 6}gcd(12, 18) = 6
Every pair of positive integers shares at least one common factor: 11 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 1212 and 1818, it is 66. 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 mm and nn is a number divisible by both. Where common factors are drawn from finite sets, common multiples form an infinite sequence.

Example
The multiples of 44 are 4,8,12,16,20,24,28,32,36,…4, 8, 12, 16, 20, 24, 28, 32, 36, \ldots The multiples of 66 are 6,12,18,24,30,36,…6, 12, 18, 24, 30, 36, \ldots The common multiples are 12,24,36,48,…12, 24, 36, 48, \ldots — every value that appears in both lists.

Pitfall: Multiplying to get the LCM
Taking 6⋅8=486 \cdot 8 = 48 as the smallest common multiple of 66 and 88 skips 2424, which both divide: 24=6⋅4=8⋅324 = 6 \cdot 4 = 8 \cdot 3. The product is the least common multiple only when the two numbers share no factor except 11, as 44 and 99 do.

The smallest positive common multiple is the LCM. For 44 and 66, it is 1212. Every other common multiple is a multiple of the LCM: 24=2⋅1224 = 2 \cdot 12, 36=3⋅1236 = 3 \cdot 12, and so on.

Common multiples arise naturally in problems involving synchronization. If one event repeats every 44 days and another every 66 days, they coincide every 1212 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⋯pkakn = p_1^{a_1} \cdot p_2^{a_2} \cdots p_k^{a_k}, the number of positive divisors of nn is:

Counting Factors
(a1+1)(a2+1)⋯(ak+1)(a_1 + 1)(a_2 + 1) \cdots (a_k + 1)

Pitfall: Multiplying the exponents
Counting the factors of 12=22⋅312 = 2^2 \cdot 3 as 2⋅1=22 \cdot 1 = 2 misses most of them. Adding 11 to each exponent gives (2+1)(1+1)=6(2 + 1)(1 + 1) = 6, the factors 1,2,3,4,6,121, 2, 3, 4, 6, 12.

Each prime factor pip_i can appear in a divisor 0,1,2,…,ai0, 1, 2, \ldots, a_i times — that is ai+1a_i + 1 independent choices. The total number of divisors is the product of all these choices.

Example
The number 72=23⋅3272 = 2^3 \cdot 3^2 has (3+1)(2+1)=12(3+1)(2+1) = 12 factors. Listing them confirms: 1,2,3,4,6,8,9,12,18,24,36,721, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72 — exactly twelve.
Factor set (single)factors of 721234689121824367212 factors72 = 2³ · 3²(3+1)(2+1) = 12matches the chip count
Pitfall: Counting with factors that are not prime
Reading 36=4⋅936 = 4 \cdot 9 as two factors with exponent 11 gives (1+1)(1+1)=4(1 + 1)(1 + 1) = 4, but 3636 has 99 factors. The formula needs primes: 36=22⋅3236 = 2^2 \cdot 3^2 gives (2+1)(2+1)=9(2 + 1)(2 + 1) = 9.

The number 100=22⋅52100 = 2^2 \cdot 5^2 has (2+1)(2+1)=9(2+1)(2+1) = 9 factors.

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⋅560 = 2^2 \cdot 3 \cdot 5 has 1212 factors, while 64=2664 = 2^6 has only 77.

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=182 \cdot 3^2 = 18 and 22⋅3=122^2 \cdot 3 = 12 both have 66 factors.

Fact: 720720720720 has 240240 factors
720720=24⋅32⋅5⋅7⋅11⋅13720720 = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13 has (4+1)(2+1)(1+1)4=240(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 11 to 1616.

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,1201, 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 6060, for example, is the smallest number with 1212 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 nn is denoted σ(n)\sigma(n). Like the divisor count, it can be computed directly from the prime factorization.

Example
For n=12n = 12: the divisors are 1,2,3,4,6,121, 2, 3, 4, 6, 12, and σ(12)=1+2+3+4+6+12=28\sigma(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28.
Factor set (single)factors of 121234612σ(12) = 28σ(12) — sum of all divisors1+2+3+4+6+12 = 2828 > 2·12 → abundant
Fact: Every even perfect number has one shape
When 2p−12^p - 1 is prime, n=2p−1(2p−1)n = 2^{p-1}(2^p - 1) is perfect, since σ(n)=(2p−1)⋅2p=2n\sigma(n) = (2^p - 1) \cdot 2^p = 2n; this gives 66, 2828, 496496 and 8,1288{,}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=6n = 6: the divisors are 1,2,3,61, 2, 3, 6, and σ(6)=1+2+3+6=12\sigma(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=61 + 2 + 3 = 6, equal to nn itself. This makes 66 a perfect number.

The next perfect number, 28=22⋅728 = 2^2 \cdot 7, has the same shape as 6=2⋅36 = 2 \cdot 3: a power of 22 times an odd prime. For a number 2k⋅q2^k \cdot q of this shape, the divisors are the powers 1,2,…,2k1, 2, \ldots, 2^k together with those same powers times qq, so σ(2kq)=(1+2+⋯+2k)(1+q)=(2k+1−1)(q+1)\sigma(2^k q) = (1 + 2 + \cdots + 2^k)(1 + q) = (2^{k+1} - 1)(q + 1). For 2828 this gives 7⋅8=56=2⋅287 \cdot 8 = 56 = 2 \cdot 28.

The relationship between σ(n)\sigma(n) and nn classifies every positive integer. When σ(n)−n=n\sigma(n) - n = n, the number is perfect. When σ(n)−n>n\sigma(n) - n > n, it is abundant. When σ(n)−n<n\sigma(n) - n < n, it is deficient. Most numbers are deficient; abundance and perfection are the exceptions.
DownloadPNG2×PDF
Layout
ClassificationSum-of-proper-divisors testIn σ-notationExamples
Perfectsum of proper divisors equals nσ(n) = 2n6, 28, 496, 8128 (extremely rare)
Abundantsum of proper divisors exceeds nσ(n) > 2n12 (proper-sum = 16), 18, 20, 24, …
Deficientsum of proper divisors falls short of nσ(n) < 2nevery prime; 10 (proper-sum = 8); most numbers
Sum of FactorsLearn Math Class

Divisor Function Notation

Notation

Divisor Function Notation

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 divides bar and its slash are owned by divisibility notation; gcd⁡\gcd and lcm⁡\operatorname{lcm} by their pages.
n=p1a1⋯pkakn = p_1^{a_1} \cdots p_k^{a_k}
n as a product of prime powers
The canonical-factorization template: pp reserved for primes, subscripts enumerating the distinct ones, exponents counting repeats — 72=23⋅3272 = 2^3 \cdot 3^2 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<⋯p_1 < p_2 < \cdots; an absent prime is exponent zero, which is exactly how the (ai+1)(a_i + 1) choice-counts of Counting Factors above work.
Do not confuseAn equation to solve. The template states a shape — nothing multiplies until a concrete nn arrives; treating p1a1p_1^{a_1} as unknowns misreads a description as a problem.
d(n)d(n) · τ(n)\tau(n)
d of n; tau of n — the divisor count
The names the counting formula answers to: (a1+1)⋯(ak+1)(a_1 + 1) \cdots (a_k + 1) of Counting Factors above computes d(n)d(n) — written τ(n)\tau(n) in number-theory texts. This page leaves the function anonymous; the literature does not.
Casesd(72)=12d(72) = 12, τ(64)=7\tau(64) = 7 — one function, two dialects: dd in elementary writing, τ\tau in research papers, alongside σ\sigma's family below.
Do not confuseA differential. The letter dd is mathematics' most overloaded — differentials own dxdx; here d(n)d(n) is an ordinary function value, its parentheses the only shield.
σ(n)\sigma(n)
sigma of n — the sum of divisors
Lowercase sigma as a named function: σ(n)\sigma(n) sums every positive divisor — σ(12)=28\sigma(12) = 28, per Sum of Factors above. The perfect/abundant/deficient classification is written entirely in σ(n)−n\sigma(n) - n comparisons.
CasesProper-divisor sums drop nn itself — σ(n)−n\sigma(n) - n, sometimes named s(n)s(n), the aliquot sum; perfect numbers are exactly the solutions of σ(n)=2n\sigma(n) = 2n.
Same glyph elsewhereThe letter's other careers: capital Σ\Sigma is the summation operator — kindred in spirit, different in grammar — and lowercase σ\sigma names singular values and standard deviations elsewhere; the argument (n)(n) marks the divisor-sum reading.
DownloadPNG2×PDF
Notation · Cheat sheet
Arithmetic Notation at a Glance
The marks from the notation cards across the arithmetic pages: how each is read and what it means. Every group links to the full card on its page.
Fractions
ab\frac{a}{b}
a over b
The vinculum: numerator over denominator, a division held in place.
a/ba/b
a slash b; a over b
The inline spelling for running text and code; same value, no grouping power.
a÷ba \div b
a divided by b
The obelus, the schoolroom division sign: a÷b=aba \div b = \frac{a}{b}.
Mixed numbers
2342\frac{3}{4}
two and three quarters
Adjacency means addition here, and only here: 2+342 + \frac{3}{4}.
3543\frac{5}{4} vs 4144\frac{1}{4}
non-standard form, and its correction
The fractional part must be proper; carry the extra whole.
−234-2\frac{3}{4}
negative two and three quarters
The minus grips the whole package: −(2+34)-(2 + \frac{3}{4}).
Divisibility
a∣ba \mid b
a divides b
A statement, true or false: b=a⋅kb = a \cdot k for some integer kk.
5∤125 \nmid 12
five does not divide twelve
The slashed bar denies: no integer kk gives 12=5k12 = 5k.
b mod a=0b \bmod a = 0
b mod a equals zero
The same fact as a computation: the remainder vanishes.
FactorsThis page
n=p1a1⋯pkakn = p_1^{a_1} \cdots p_k^{a_k}
n as a product of prime powers
Canonical factorisation: pp for primes, exponents count repeats.
d(n)d(n) · τ(n)\tau(n)
d of n; tau of n
The number of positive divisors of nn.
σ(n)\sigma(n)
sigma of n
The sum of the positive divisors: σ(12)=28\sigma(12) = 28.
GCD
gcd⁡(a,b)\gcd(a, b)
the g-c-d of a and b
Greatest common divisor, in function spelling.
HCF, GCF\text{HCF, GCF}
highest, or greatest, common factor
Other names for the gcd: HCF in British and Indian schools, GCF in American schools.
gcd⁡(a,b)=1\gcd(a, b) = 1
a and b are coprime
The equation is the notation; coprimality has no mark of its own.
LCM
lcm⁡(a,b)\operatorname{lcm}(a, b)
the l-c-m of a and b
Least common multiple, the mirror twin of gcd⁡\gcd.
[a,b][a, b]
bracket a, b
Number theory’s shorthand for the lcm; (a,b)(a, b) is the gcd.
LCM vs LCD\text{LCM vs LCD}
least common multiple; least common denominator
The LCD of fractions is the LCM of their denominators.
Modulo
a mod na \bmod n
a mod n
The operator that computes a remainder: 17 mod 5=217 \bmod 5 = 2.
a % na \ \% \ n
a percent n
The remainder operator in code: C, Java, Python, JavaScript.
a≡b(modn)a \equiv b \pmod{n}
a is congruent to b modulo n
A statement: aa and bb leave the same remainder.
Integer part
⌊x⌋\lfloor x \rfloor
floor of x
The greatest integer at most xx: the integer part.
⌈x⌉\lceil x \rceil
ceiling of x
The least integer at least xx.
{x}\{x\}
fractional part of x
What the floor leaves: x−⌊x⌋x - \lfloor x \rfloor, in [0,1)[0, 1).
⌊x+12⌋\lfloor x + \tfrac{1}{2} \rfloor
x rounded to the nearest integer
Rounding built from the floor; ties go up: 2.5→32.5 \to 3.
Same marks, different job
a∣ba \mid bDivides, between integers; such that, inside set braces; absolute value when doubled.
(a,b)(a, b) vs [a,b][a, b]The gcd and the lcm in number-theory shorthand; a point or an interval elsewhere.
{x}\{x\}The fractional part here; a one-element set in set theory.
 mod \bmod vs (modn)\pmod{n}An operator that returns a number; a label on a congruence statement.
σ(n)\sigma(n)The divisor sum here; a standard deviation in statistics.
Arithmetic Notation at a Glance·/arithmeticLearn Math Class

Worked Examples

Find all factors of 4848. Test from 11 to 48≈6.9\sqrt{48} \approx 6.9: 1∣481 \mid 48 (pair 1,481, 48), 2∣482 \mid 48 (pair 2,242, 24), 3∣483 \mid 48 (pair 3,163, 16), 4∣484 \mid 48 (pair 4,124, 12), 5∤485 \nmid 48, 6∣486 \mid 48 (pair 6,86, 8). Factors: {1,2,3,4,6,8,12,16,24,48}\{1, 2, 3, 4, 6, 8, 12, 16, 24, 48\} — ten in total.

List the first 88 multiples of 99: 9,18,27,36,45,54,63,729, 18, 27, 36, 45, 54, 63, 72.

Find the common factors of 3030 and 4545. Factors of 3030: {1,2,3,5,6,10,15,30}\{1, 2, 3, 5, 6, 10, 15, 30\}. Factors of 4545: {1,3,5,9,15,45}\{1, 3, 5, 9, 15, 45\}. Common: {1,3,5,15}\{1, 3, 5, 15\}. The GCD is 1515.

Count the factors of 180=22⋅32⋅5180 = 2^2 \cdot 3^2 \cdot 5. Formula: (2+1)(2+1)(1+1)=18(2+1)(2+1)(1+1) = 18 factors.

Is 2828 perfect? Proper divisors: 1,2,4,7,141, 2, 4, 7, 14. Sum: 1+2+4+7+14=281 + 2 + 4 + 7 + 14 = 28. Yes — 2828 is the second perfect number.

Is 2020 abundant or deficient? Proper divisors: 1,2,4,5,101, 2, 4, 5, 10. Sum: 22>2022 > 20. Abundant.

Summary: A Toolkit for Divisor Structure

Every question this page addresses about a number nn — 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.
DownloadPNG2×PDF
Layout
Question about nTool or formulaWorked example
Find every factorpair-search from 1 to √n: each a with a ∣ n gives the pair (a, n / a)n = 36: test 1–6 → pairs (1,36), (2,18), (3,12), (4,9), (6,6) → 9 factors
Count the factorsfactor n = p₁a1^{a₁} · … · pₖak^{aₖ}; the number of divisors is (a₁+1)(a₂+1)…(aₖ+1)72 = 2³ · 3² → (3+1)(2+1) = 12 factors
Classify n (perfect / abundant / deficient)sum the proper divisors and compare to n6: 1 + 2 + 3 = 6 → perfect; 12: 1+2+3+4+6 = 16 > 12 → abundant
Find common factors with mintersect the factor sets; the largest is gcd(m, n)12 ∩ 18 in factors → {1, 2, 3, 6}; gcd = 6
Find common multiples with mthe smallest is lcm(m, n); every common multiple is a multiple of it4 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.
DownloadPNG2×PDF
1Forgetting the partner factors
The pair search tests candidates only up to n\sqrt{n}. Each test that succeeds is written down, but its partner na\frac{n}{a} is not, so the list stops at n\sqrt{n} and misses every factor above it.
Start
For n=36n = 36,
Wrong turn
Error here
The tests for 1,2,3,4,61, 2, 3, 4, 6 succeed, so the factors of 3636 are 1,2,3,4,61, 2, 3, 4, 6, five in total.
Right path
Each success gives a pair: (1,36)(1, 36), (2,18)(2, 18), (3,12)(3, 12), (4,9)(4, 9), (6,6)(6, 6). The factors are 1,2,3,4,6,9,12,18,361, 2, 3, 4, 6, 9, 12, 18, 36, nine in total.
Why it happensThe rule "test up to n\sqrt{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 nn is nn itself. A list of the factors of 3636 that does not end in 3636 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
1616 has the pairs (1,16)(1, 16), (2,8)(2, 8) and (4,4)(4, 4), so it has 3⋅2=63 \cdot 2 = 6 factors.
Right path
The pair (4,4)(4, 4) contributes the single factor 44. The factors of 1616 are 1,2,4,8,161, 2, 4, 8, 16, five in total. In the same way 3636 has 99 factors, not 1010.
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 1616, 3636 or 100100 means the root was counted twice. The counting formula agrees: 16=2416 = 2^4 has 4+1=54 + 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 nn, and every number looks abundant.
Wrong turn
Error here
For 2828, 1+2+4+7+14+28=56>281 + 2 + 4 + 7 + 14 + 28 = 56 > 28, so 2828 is abundant.
Right path
The proper divisors leave out 2828 itself. Their sum is 1+2+4+7+14=281 + 2 + 4 + 7 + 14 = 28, equal to the number, so 2828 is perfect.
Why it happensThe full list of divisors ends with nn, and the sum σ(n)\sigma(n) in Sum of Factors includes it. The word "proper" is the only signal to drop it.
How to checkWith nn included, the sum of the divisors of any n>1n > 1 is at least n+1n + 1, so if every number tested comes out abundant, nn was counted. When the full sum σ(n)\sigma(n) is used, compare it with 2n2n, not with nn: σ(28)=56=2⋅28\sigma(28) = 56 = 2 \cdot 28.
4Mixing up factors and multiples
The two words for the two sides of a∣ba \mid b are swapped, so the numbers that go into nn are listed as its multiples, or the numbers it goes into as its factors.
Wrong turn
Error here
The multiples of 1212 are 1,2,3,4,6,121, 2, 3, 4, 6, 12.
Right path
Those are the factors of 1212, the numbers that divide it. The multiples of 1212 are 12⋅1,12⋅2,12⋅3,…12 \cdot 1, 12 \cdot 2, 12 \cdot 3, \ldots, that is 12,24,36,48,…12, 24, 36, 48, \ldots
Why it happensBoth words come from the same multiplication fact. 12=3⋅412 = 3 \cdot 4 makes 33 a factor of 1212 and 1212 a multiple of 33, and which side each word belongs to has to be remembered.
How to checkCompare sizes and count. A positive factor of nn is at most nn and there are finitely many; a positive multiple of nn is at least nn 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 66 and 88 is 6⋅8=486 \cdot 8 = 48.
Right path
The multiples of 66 are 6,12,18,24,…6, 12, 18, 24, \ldots and the multiples of 88 are 8,16,24,…8, 16, 24, \ldots, and the first one they share is 2424. The product 48=2⋅2448 = 2 \cdot 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 11, as 44 and 99 do, it is the least one, 3636. The shortcut works often enough to seem like a rule.
How to checkIf the two numbers share a factor d>1d > 1, the product divided by dd is still a common multiple. Both 66 and 88 are even, and 48÷2=2448 \div 2 = 24 is divisible by both: 24=6⋅4=8⋅324 = 6 \cdot 4 = 8 \cdot 3.
6Multiplying the exponents
In the factor-count formula the added 11s are dropped, and the exponents of the prime factorization are multiplied as they stand.
Wrong turn
Error here
12=22⋅312 = 2^2 \cdot 3 has exponents 22 and 11, so it has 2⋅1=22 \cdot 1 = 2 factors.
Right path
An exponent aia_i allows ai+1a_i + 1 choices, from 00 to aia_i copies of its prime. So 1212 has (2+1)(1+1)=6(2 + 1)(1 + 1) = 6 factors: 1,2,3,4,6,121, 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=238 = 2^3 are 1,2,4,81, 2, 4, 8, four of them, which is 3+13 + 1 and not 33. For 72=23⋅3272 = 2^3 \cdot 3^2, multiplying the exponents gives 66, while Counting Factors lists 1212.
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⋅936 = 4 \cdot 9, two bases with exponent 11, so 3636 has (1+1)(1+1)=4(1 + 1)(1 + 1) = 4 factors.
Right path
Break each base down to primes first. 4=224 = 2^2 and 9=329 = 3^2, so 36=22⋅3236 = 2^2 \cdot 3^2 and it has (2+1)(2+1)=9(2 + 1)(2 + 1) = 9 factors: 1,2,3,4,6,9,12,18,361, 2, 3, 4, 6, 9, 12, 18, 36.
Why it happens4⋅94 \cdot 9 is a true factorization, and the formula looks as if it reads any exponents. It counts correctly only with primes; built from 44 and 99 alone, the factors 22, 33, 66, 1212 and 1818 never appear.
How to checkEvery base must be prime before the formula is used. The pair search also catches it: 3636 has the pairs (1,36)(1, 36), (2,18)(2, 18), (3,12)(3, 12), (4,9)(4, 9), (6,6)(6, 6), far more than four factors.
Common pitfalls with factors and multiples·/arithmetic/divisibility/factorsLearn Math Class
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 nn while a multiple is at least nn, the LCM divides the product by the GCD, and the counting formula (a1+1)(a2+1)⋯(a_1 + 1)(a_2 + 1) \cdots needs every base to be prime. Checking that the list ends in nn itself, comparing sizes, or trying a prime power such as 8=238 = 2^3 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\gcd(72, 120) = 2^3 \cdot 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)=a⋅bgcd⁡(a,b)\operatorname{lcm}(a, b) = \frac{a \cdot b}{\gcd(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 22: 1,7461{,}746, 3,8213{,}821, 90,31890{,}318.
  • Test divisibility by 3Single ruleYou want to know whether 33 divides a number without dividing it: 729729, 1,2341{,}234, 5,8325{,}832.
  • Test divisibility by 5Single ruleYou want to know whether 55 divides a number, for example while factoring or simplifying a fraction: 4,8354{,}835, 7,8327{,}832, 990990.

Factors and Multiples FAQ

What is a perfect number?

+
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)2^{p-1}(2^p - 1) is perfect whenever 2p−12^p - 1 is prime, which gives 66, 2828, 496496 and 8,1288{,}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,1201, 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⋅13720720 = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13 has 240240 factors, more than any smaller number. Ramanujan studied them in 1915.Read more →

Is zero a multiple of every number?

+
Yes. Zero equals a⋅0a \cdot 0 for every integer aa, so it meets the definition of a multiple of aa exactly and stands at the start of every list of multiples: 0,7,14,21,…0, 7, 14, 21, \ldots for 77. 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 00.Read more →