Divisors of 660: All 24 Factors
Quick Answer
660 has 24 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 132, 165, 220, 330, 660.
Sum: 2016.
Divisors (Factors) Calculator
Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).
All Divisors of 660
The number 660 has 24 divisors:
1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 132, 165, 220, 330, 660
Divisor Pairs of 660
Each pair multiplies to 660:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 660 | = | 660 |
| 2 | × | 330 | = | 660 |
| 3 | × | 220 | = | 660 |
| 4 | × | 165 | = | 660 |
| 5 | × | 132 | = | 660 |
| 6 | × | 110 | = | 660 |
| 10 | × | 66 | = | 660 |
| 11 | × | 60 | = | 660 |
| 12 | × | 55 | = | 660 |
| 15 | × | 44 | = | 660 |
| 20 | × | 33 | = | 660 |
| 22 | × | 30 | = | 660 |
Number of Divisors
The number 660 has 24 divisors, written as τ(660) = 24 in number theory.
Sum of Divisors
σ(660) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 11 + 12 + 15 + 20 + 22 + 30 + 33 + 44 + 55 + 60 + 66 + 110 + 132 + 165 + 220 + 330 + 660 = 2016
Prime Factorization of 660
Properties of 660
- 660 is composite.
- 660 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 2016.
Common Divisors with Another Number?
Looking for the divisors that 660 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.
Step-by-Step: How to Find the Divisors of 660
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √660 ≈ 25.69. If i divides 660, then both i and 660/i are divisors.
- 1 divides 660 (660 ÷ 1 = 660) → pair (1, 660)
- 2 divides 660 (660 ÷ 2 = 330) → pair (2, 330)
- 3 divides 660 (660 ÷ 3 = 220) → pair (3, 220)
- 4 divides 660 (660 ÷ 4 = 165) → pair (4, 165)
- 5 divides 660 (660 ÷ 5 = 132) → pair (5, 132)
- 6 divides 660 (660 ÷ 6 = 110) → pair (6, 110)
- 10 divides 660 (660 ÷ 10 = 66) → pair (10, 66)
- 11 divides 660 (660 ÷ 11 = 60) → pair (11, 60)
- 12 divides 660 (660 ÷ 12 = 55) → pair (12, 55)
- 15 divides 660 (660 ÷ 15 = 44) → pair (15, 44)
- 20 divides 660 (660 ÷ 20 = 33) → pair (20, 33)
- 22 divides 660 (660 ÷ 22 = 30) → pair (22, 30)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 132, 165, 220, 330, 660} — total 24 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 11 + 12 + 15 + 20 + 22 + 30 + 33 + 44 + 55 + 60 + 66 + 110 + 132 + 165 + 220 + 330 + 660 = 2016.
Nearby Examples
Related Operations for 660
- Multiples of 660 — "outward" complement; M is a multiple of 660 ⇔ 660 is a divisor of M
- 660 Prime Factorization — decompose into prime building blocks
- Find GCF of 660 and another number
- Find LCM of 660 and another number
- Is 660 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
What Is a Divisor?
A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.
Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.
Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.
Divisors Calculation Examples
Find all divisors of these numbers:
Related Calculators
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check