Divisors of 32970: All 32 Factors

Quick Answer

32970 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 157, 210, 314, 471, 785, 942, 1099, 1570, 2198, 2355, 3297, 4710, 5495, 6594, 10990, 16485, 32970.

Sum: 91008.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 157, 210, 314, 471, 785, 942, 1099, 1570, 2198, 2355, 3297, 4710, 5495, 6594, 10990, 16485, 32970

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 32970

The number 32970 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  70,  105,  157,  210,  314,  471,  785,  942,  1099,  1570,  2198,  2355,  3297,  4710,  5495,  6594,  10990,  16485,  32970

Divisor Pairs of 32970

Each pair multiplies to 32970:

Factor 1×Factor 2=Product
1×32970=32970
2×16485=32970
3×10990=32970
5×6594=32970
6×5495=32970
7×4710=32970
10×3297=32970
14×2355=32970
15×2198=32970
21×1570=32970
30×1099=32970
35×942=32970
42×785=32970
70×471=32970
105×314=32970
157×210=32970

Number of Divisors

The number 32970 has 32 divisors, written as τ(32970) = 32 in number theory.

Sum of Divisors

σ(32970) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 105 + 157 + 210 + 314 + 471 + 785 + 942 + 1099 + 1570 + 2198 + 2355 + 3297 + 4710 + 5495 + 6594 + 10990 + 16485 + 32970 = 91008

Properties of 32970

  • 32970 is composite.
  • 32970 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 91008.

Common Divisors with Another Number?

Looking for the divisors that 32970 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 32970

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √32970 ≈ 181.58. If i divides 32970, then both i and 32970/i are divisors.

  1. 1 divides 32970 (32970 ÷ 1 = 32970) → pair (1, 32970)
  2. 2 divides 32970 (32970 ÷ 2 = 16485) → pair (2, 16485)
  3. 3 divides 32970 (32970 ÷ 3 = 10990) → pair (3, 10990)
  4. 5 divides 32970 (32970 ÷ 5 = 6594) → pair (5, 6594)
  5. 6 divides 32970 (32970 ÷ 6 = 5495) → pair (6, 5495)
  6. 7 divides 32970 (32970 ÷ 7 = 4710) → pair (7, 4710)
  7. 10 divides 32970 (32970 ÷ 10 = 3297) → pair (10, 3297)
  8. 14 divides 32970 (32970 ÷ 14 = 2355) → pair (14, 2355)
  9. 15 divides 32970 (32970 ÷ 15 = 2198) → pair (15, 2198)
  10. 21 divides 32970 (32970 ÷ 21 = 1570) → pair (21, 1570)
  11. 30 divides 32970 (32970 ÷ 30 = 1099) → pair (30, 1099)
  12. 35 divides 32970 (32970 ÷ 35 = 942) → pair (35, 942)
  13. 42 divides 32970 (32970 ÷ 42 = 785) → pair (42, 785)
  14. 70 divides 32970 (32970 ÷ 70 = 471) → pair (70, 471)
  15. 105 divides 32970 (32970 ÷ 105 = 314) → pair (105, 314)
  16. 157 divides 32970 (32970 ÷ 157 = 210) → pair (157, 210)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 157, 210, 314, 471, 785, 942, 1099, 1570, 2198, 2355, 3297, 4710, 5495, 6594, 10990, 16485, 32970} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 105 + 157 + 210 + 314 + 471 + 785 + 942 + 1099 + 1570 + 2198 + 2355 + 3297 + 4710 + 5495 + 6594 + 10990 + 16485 + 32970 = 91008.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 32970

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