Divisors of 2970: All 32 Factors
Quick Answer
2970 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 27, 30, 33, 45, 54, 55, 66, 90, 99, 110, 135, 165, 198, 270, 297, 330, 495, 594, 990, 1485, 2970.
Sum: 8640.
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 2970
The number 2970 has 32 divisors:
1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 27, 30, 33, 45, 54, 55, 66, 90, 99, 110, 135, 165, 198, 270, 297, 330, 495, 594, 990, 1485, 2970
Divisor Pairs of 2970
Each pair multiplies to 2970:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 2970 | = | 2970 |
| 2 | × | 1485 | = | 2970 |
| 3 | × | 990 | = | 2970 |
| 5 | × | 594 | = | 2970 |
| 6 | × | 495 | = | 2970 |
| 9 | × | 330 | = | 2970 |
| 10 | × | 297 | = | 2970 |
| 11 | × | 270 | = | 2970 |
| 15 | × | 198 | = | 2970 |
| 18 | × | 165 | = | 2970 |
| 22 | × | 135 | = | 2970 |
| 27 | × | 110 | = | 2970 |
| 30 | × | 99 | = | 2970 |
| 33 | × | 90 | = | 2970 |
| 45 | × | 66 | = | 2970 |
| 54 | × | 55 | = | 2970 |
Number of Divisors
The number 2970 has 32 divisors, written as τ(2970) = 32 in number theory.
Sum of Divisors
σ(2970) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 11 + 15 + 18 + 22 + 27 + 30 + 33 + 45 + 54 + 55 + 66 + 90 + 99 + 110 + 135 + 165 + 198 + 270 + 297 + 330 + 495 + 594 + 990 + 1485 + 2970 = 8640
Prime Factorization of 2970
Properties of 2970
- 2970 is composite.
- 2970 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 8640.
Common Divisors with Another Number?
Looking for the divisors that 2970 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 2970
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √2970 ≈ 54.50. If i divides 2970, then both i and 2970/i are divisors.
- 1 divides 2970 (2970 ÷ 1 = 2970) → pair (1, 2970)
- 2 divides 2970 (2970 ÷ 2 = 1485) → pair (2, 1485)
- 3 divides 2970 (2970 ÷ 3 = 990) → pair (3, 990)
- 5 divides 2970 (2970 ÷ 5 = 594) → pair (5, 594)
- 6 divides 2970 (2970 ÷ 6 = 495) → pair (6, 495)
- 9 divides 2970 (2970 ÷ 9 = 330) → pair (9, 330)
- 10 divides 2970 (2970 ÷ 10 = 297) → pair (10, 297)
- 11 divides 2970 (2970 ÷ 11 = 270) → pair (11, 270)
- 15 divides 2970 (2970 ÷ 15 = 198) → pair (15, 198)
- 18 divides 2970 (2970 ÷ 18 = 165) → pair (18, 165)
- 22 divides 2970 (2970 ÷ 22 = 135) → pair (22, 135)
- 27 divides 2970 (2970 ÷ 27 = 110) → pair (27, 110)
- 30 divides 2970 (2970 ÷ 30 = 99) → pair (30, 99)
- 33 divides 2970 (2970 ÷ 33 = 90) → pair (33, 90)
- 45 divides 2970 (2970 ÷ 45 = 66) → pair (45, 66)
- 54 divides 2970 (2970 ÷ 54 = 55) → pair (54, 55)
- Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 27, 30, 33, 45, 54, 55, 66, 90, 99, 110, 135, 165, 198, 270, 297, 330, 495, 594, 990, 1485, 2970} — total 32 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 11 + 15 + 18 + 22 + 27 + 30 + 33 + 45 + 54 + 55 + 66 + 90 + 99 + 110 + 135 + 165 + 198 + 270 + 297 + 330 + 495 + 594 + 990 + 1485 + 2970 = 8640.
Nearby Examples
Related Operations for 2970
- Multiples of 2970 — "outward" complement; M is a multiple of 2970 ⇔ 2970 is a divisor of M
- 2970 Prime Factorization — decompose into prime building blocks
- Find GCF of 2970 and another number
- Find LCM of 2970 and another number
- Is 2970 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