Divisors of 30072: All 32 Factors

Quick Answer

30072 has 32 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168, 179, 358, 537, 716, 1074, 1253, 1432, 2148, 2506, 3759, 4296, 5012, 7518, 10024, 15036, 30072.

Sum: 86400.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168, 179, 358, 537, 716, 1074, 1253, 1432, 2148, 2506, 3759, 4296, 5012, 7518, 10024, 15036, 30072

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 30072

The number 30072 has 32 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  21,  24,  28,  42,  56,  84,  168,  179,  358,  537,  716,  1074,  1253,  1432,  2148,  2506,  3759,  4296,  5012,  7518,  10024,  15036,  30072

Divisor Pairs of 30072

Each pair multiplies to 30072:

Factor 1×Factor 2=Product
1×30072=30072
2×15036=30072
3×10024=30072
4×7518=30072
6×5012=30072
7×4296=30072
8×3759=30072
12×2506=30072
14×2148=30072
21×1432=30072
24×1253=30072
28×1074=30072
42×716=30072
56×537=30072
84×358=30072
168×179=30072

Number of Divisors

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

Sum of Divisors

σ(30072) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 84 + 168 + 179 + 358 + 537 + 716 + 1074 + 1253 + 1432 + 2148 + 2506 + 3759 + 4296 + 5012 + 7518 + 10024 + 15036 + 30072 = 86400

Properties of 30072

  • 30072 is composite.
  • 30072 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 86400.

Common Divisors with Another Number?

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

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

  1. 1 divides 30072 (30072 ÷ 1 = 30072) → pair (1, 30072)
  2. 2 divides 30072 (30072 ÷ 2 = 15036) → pair (2, 15036)
  3. 3 divides 30072 (30072 ÷ 3 = 10024) → pair (3, 10024)
  4. 4 divides 30072 (30072 ÷ 4 = 7518) → pair (4, 7518)
  5. 6 divides 30072 (30072 ÷ 6 = 5012) → pair (6, 5012)
  6. 7 divides 30072 (30072 ÷ 7 = 4296) → pair (7, 4296)
  7. 8 divides 30072 (30072 ÷ 8 = 3759) → pair (8, 3759)
  8. 12 divides 30072 (30072 ÷ 12 = 2506) → pair (12, 2506)
  9. 14 divides 30072 (30072 ÷ 14 = 2148) → pair (14, 2148)
  10. 21 divides 30072 (30072 ÷ 21 = 1432) → pair (21, 1432)
  11. 24 divides 30072 (30072 ÷ 24 = 1253) → pair (24, 1253)
  12. 28 divides 30072 (30072 ÷ 28 = 1074) → pair (28, 1074)
  13. 42 divides 30072 (30072 ÷ 42 = 716) → pair (42, 716)
  14. 56 divides 30072 (30072 ÷ 56 = 537) → pair (56, 537)
  15. 84 divides 30072 (30072 ÷ 84 = 358) → pair (84, 358)
  16. 168 divides 30072 (30072 ÷ 168 = 179) → pair (168, 179)
  17. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168, 179, 358, 537, 716, 1074, 1253, 1432, 2148, 2506, 3759, 4296, 5012, 7518, 10024, 15036, 30072} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 84 + 168 + 179 + 358 + 537 + 716 + 1074 + 1253 + 1432 + 2148 + 2506 + 3759 + 4296 + 5012 + 7518 + 10024 + 15036 + 30072 = 86400.

Nearby Examples

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

Related Operations for 30072

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