Divisors of 30100: All 36 Factors

Quick Answer

30100 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 14, 20, 25, 28, 35, 43, 50, 70, 86, 100, 140, 172, 175, 215, 301, 350, 430, 602, 700, 860, 1075, 1204, 1505, 2150, 3010, 4300, 6020, 7525, 15050, 30100.

Sum: 76384.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 14, 20, 25, 28, 35, 43, 50, 70, 86, 100, 140, 172, 175, 215, 301, 350, 430, 602, 700, 860, 1075, 1204, 1505, 2150, 3010, 4300, 6020, 7525, 15050, 30100

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 30100

The number 30100 has 36 divisors:

1,  2,  4,  5,  7,  10,  14,  20,  25,  28,  35,  43,  50,  70,  86,  100,  140,  172,  175,  215,  301,  350,  430,  602,  700,  860,  1075,  1204,  1505,  2150,  3010,  4300,  6020,  7525,  15050,  30100

Divisor Pairs of 30100

Each pair multiplies to 30100:

Factor 1×Factor 2=Product
1×30100=30100
2×15050=30100
4×7525=30100
5×6020=30100
7×4300=30100
10×3010=30100
14×2150=30100
20×1505=30100
25×1204=30100
28×1075=30100
35×860=30100
43×700=30100
50×602=30100
70×430=30100
86×350=30100
100×301=30100
140×215=30100
172×175=30100

Number of Divisors

The number 30100 has 36 divisors, written as τ(30100) = 36 in number theory.

Sum of Divisors

σ(30100) = 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 25 + 28 + 35 + 43 + 50 + 70 + 86 + 100 + 140 + 172 + 175 + 215 + 301 + 350 + 430 + 602 + 700 + 860 + 1075 + 1204 + 1505 + 2150 + 3010 + 4300 + 6020 + 7525 + 15050 + 30100 = 76384

Properties of 30100

  • 30100 is composite.
  • 30100 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 76384.

Common Divisors with Another Number?

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

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

  1. 1 divides 30100 (30100 ÷ 1 = 30100) → pair (1, 30100)
  2. 2 divides 30100 (30100 ÷ 2 = 15050) → pair (2, 15050)
  3. 4 divides 30100 (30100 ÷ 4 = 7525) → pair (4, 7525)
  4. 5 divides 30100 (30100 ÷ 5 = 6020) → pair (5, 6020)
  5. 7 divides 30100 (30100 ÷ 7 = 4300) → pair (7, 4300)
  6. 10 divides 30100 (30100 ÷ 10 = 3010) → pair (10, 3010)
  7. 14 divides 30100 (30100 ÷ 14 = 2150) → pair (14, 2150)
  8. 20 divides 30100 (30100 ÷ 20 = 1505) → pair (20, 1505)
  9. 25 divides 30100 (30100 ÷ 25 = 1204) → pair (25, 1204)
  10. 28 divides 30100 (30100 ÷ 28 = 1075) → pair (28, 1075)
  11. 35 divides 30100 (30100 ÷ 35 = 860) → pair (35, 860)
  12. 43 divides 30100 (30100 ÷ 43 = 700) → pair (43, 700)
  13. 50 divides 30100 (30100 ÷ 50 = 602) → pair (50, 602)
  14. 70 divides 30100 (30100 ÷ 70 = 430) → pair (70, 430)
  15. 86 divides 30100 (30100 ÷ 86 = 350) → pair (86, 350)
  16. 100 divides 30100 (30100 ÷ 100 = 301) → pair (100, 301)
  17. 140 divides 30100 (30100 ÷ 140 = 215) → pair (140, 215)
  18. 172 divides 30100 (30100 ÷ 172 = 175) → pair (172, 175)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 14, 20, 25, 28, 35, 43, 50, 70, 86, 100, 140, 172, 175, 215, 301, 350, 430, 602, 700, 860, 1075, 1204, 1505, 2150, 3010, 4300, 6020, 7525, 15050, 30100} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 25 + 28 + 35 + 43 + 50 + 70 + 86 + 100 + 140 + 172 + 175 + 215 + 301 + 350 + 430 + 602 + 700 + 860 + 1075 + 1204 + 1505 + 2150 + 3010 + 4300 + 6020 + 7525 + 15050 + 30100 = 76384.

Nearby Examples

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

Related Operations for 30100

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