Divisors of 32250: All 32 Factors

Quick Answer

32250 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 25, 30, 43, 50, 75, 86, 125, 129, 150, 215, 250, 258, 375, 430, 645, 750, 1075, 1290, 2150, 3225, 5375, 6450, 10750, 16125, 32250.

Sum: 82368.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 10, 15, 25, 30, 43, 50, 75, 86, 125, 129, 150, 215, 250, 258, 375, 430, 645, 750, 1075, 1290, 2150, 3225, 5375, 6450, 10750, 16125, 32250

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 32250

The number 32250 has 32 divisors:

1,  2,  3,  5,  6,  10,  15,  25,  30,  43,  50,  75,  86,  125,  129,  150,  215,  250,  258,  375,  430,  645,  750,  1075,  1290,  2150,  3225,  5375,  6450,  10750,  16125,  32250

Divisor Pairs of 32250

Each pair multiplies to 32250:

Factor 1×Factor 2=Product
1×32250=32250
2×16125=32250
3×10750=32250
5×6450=32250
6×5375=32250
10×3225=32250
15×2150=32250
25×1290=32250
30×1075=32250
43×750=32250
50×645=32250
75×430=32250
86×375=32250
125×258=32250
129×250=32250
150×215=32250

Number of Divisors

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

Sum of Divisors

σ(32250) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 43 + 50 + 75 + 86 + 125 + 129 + 150 + 215 + 250 + 258 + 375 + 430 + 645 + 750 + 1075 + 1290 + 2150 + 3225 + 5375 + 6450 + 10750 + 16125 + 32250 = 82368

Properties of 32250

  • 32250 is composite.
  • 32250 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 82368.

Common Divisors with Another Number?

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

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

  1. 1 divides 32250 (32250 ÷ 1 = 32250) → pair (1, 32250)
  2. 2 divides 32250 (32250 ÷ 2 = 16125) → pair (2, 16125)
  3. 3 divides 32250 (32250 ÷ 3 = 10750) → pair (3, 10750)
  4. 5 divides 32250 (32250 ÷ 5 = 6450) → pair (5, 6450)
  5. 6 divides 32250 (32250 ÷ 6 = 5375) → pair (6, 5375)
  6. 10 divides 32250 (32250 ÷ 10 = 3225) → pair (10, 3225)
  7. 15 divides 32250 (32250 ÷ 15 = 2150) → pair (15, 2150)
  8. 25 divides 32250 (32250 ÷ 25 = 1290) → pair (25, 1290)
  9. 30 divides 32250 (32250 ÷ 30 = 1075) → pair (30, 1075)
  10. 43 divides 32250 (32250 ÷ 43 = 750) → pair (43, 750)
  11. 50 divides 32250 (32250 ÷ 50 = 645) → pair (50, 645)
  12. 75 divides 32250 (32250 ÷ 75 = 430) → pair (75, 430)
  13. 86 divides 32250 (32250 ÷ 86 = 375) → pair (86, 375)
  14. 125 divides 32250 (32250 ÷ 125 = 258) → pair (125, 258)
  15. 129 divides 32250 (32250 ÷ 129 = 250) → pair (129, 250)
  16. 150 divides 32250 (32250 ÷ 150 = 215) → pair (150, 215)
  17. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 25, 30, 43, 50, 75, 86, 125, 129, 150, 215, 250, 258, 375, 430, 645, 750, 1075, 1290, 2150, 3225, 5375, 6450, 10750, 16125, 32250} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 43 + 50 + 75 + 86 + 125 + 129 + 150 + 215 + 250 + 258 + 375 + 430 + 645 + 750 + 1075 + 1290 + 2150 + 3225 + 5375 + 6450 + 10750 + 16125 + 32250 = 82368.

Nearby Examples

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

Related Operations for 32250

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