Divisors of 30750: All 32 Factors

Quick Answer

30750 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 25, 30, 41, 50, 75, 82, 123, 125, 150, 205, 246, 250, 375, 410, 615, 750, 1025, 1230, 2050, 3075, 5125, 6150, 10250, 15375, 30750.

Sum: 78624.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 10, 15, 25, 30, 41, 50, 75, 82, 123, 125, 150, 205, 246, 250, 375, 410, 615, 750, 1025, 1230, 2050, 3075, 5125, 6150, 10250, 15375, 30750

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 30750

The number 30750 has 32 divisors:

1,  2,  3,  5,  6,  10,  15,  25,  30,  41,  50,  75,  82,  123,  125,  150,  205,  246,  250,  375,  410,  615,  750,  1025,  1230,  2050,  3075,  5125,  6150,  10250,  15375,  30750

Divisor Pairs of 30750

Each pair multiplies to 30750:

Factor 1×Factor 2=Product
1×30750=30750
2×15375=30750
3×10250=30750
5×6150=30750
6×5125=30750
10×3075=30750
15×2050=30750
25×1230=30750
30×1025=30750
41×750=30750
50×615=30750
75×410=30750
82×375=30750
123×250=30750
125×246=30750
150×205=30750

Number of Divisors

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

Sum of Divisors

σ(30750) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 41 + 50 + 75 + 82 + 123 + 125 + 150 + 205 + 246 + 250 + 375 + 410 + 615 + 750 + 1025 + 1230 + 2050 + 3075 + 5125 + 6150 + 10250 + 15375 + 30750 = 78624

Properties of 30750

  • 30750 is composite.
  • 30750 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 78624.

Common Divisors with Another Number?

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

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

  1. 1 divides 30750 (30750 ÷ 1 = 30750) → pair (1, 30750)
  2. 2 divides 30750 (30750 ÷ 2 = 15375) → pair (2, 15375)
  3. 3 divides 30750 (30750 ÷ 3 = 10250) → pair (3, 10250)
  4. 5 divides 30750 (30750 ÷ 5 = 6150) → pair (5, 6150)
  5. 6 divides 30750 (30750 ÷ 6 = 5125) → pair (6, 5125)
  6. 10 divides 30750 (30750 ÷ 10 = 3075) → pair (10, 3075)
  7. 15 divides 30750 (30750 ÷ 15 = 2050) → pair (15, 2050)
  8. 25 divides 30750 (30750 ÷ 25 = 1230) → pair (25, 1230)
  9. 30 divides 30750 (30750 ÷ 30 = 1025) → pair (30, 1025)
  10. 41 divides 30750 (30750 ÷ 41 = 750) → pair (41, 750)
  11. 50 divides 30750 (30750 ÷ 50 = 615) → pair (50, 615)
  12. 75 divides 30750 (30750 ÷ 75 = 410) → pair (75, 410)
  13. 82 divides 30750 (30750 ÷ 82 = 375) → pair (82, 375)
  14. 123 divides 30750 (30750 ÷ 123 = 250) → pair (123, 250)
  15. 125 divides 30750 (30750 ÷ 125 = 246) → pair (125, 246)
  16. 150 divides 30750 (30750 ÷ 150 = 205) → pair (150, 205)
  17. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 25, 30, 41, 50, 75, 82, 123, 125, 150, 205, 246, 250, 375, 410, 615, 750, 1025, 1230, 2050, 3075, 5125, 6150, 10250, 15375, 30750} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 41 + 50 + 75 + 82 + 123 + 125 + 150 + 205 + 246 + 250 + 375 + 410 + 615 + 750 + 1025 + 1230 + 2050 + 3075 + 5125 + 6150 + 10250 + 15375 + 30750 = 78624.

Nearby Examples

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

Related Operations for 30750

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