Divisors of 30: All 8 Factors

Quick Answer

30 has 8 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 30.

Sum: 72.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 2, 3, 5, 6, 10, 15, 30

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 30

The number 30 has 8 divisors:

1,  2,  3,  5,  6,  10,  15,  30

Divisor Pairs of 30

Each pair multiplies to 30:

Factor 1×Factor 2=Product
1×30=30
2×15=30
3×10=30
5×6=30

Number of Divisors

The number 30 has 8 divisors, written as τ(30) = 8 in number theory.

Sum of Divisors

σ(30) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 = 72

Properties of 30

  • 30 is composite.
  • 30 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 72.

Common Divisors with Another Number?

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

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

  1. 1 divides 30 (30 ÷ 1 = 30) → pair (1, 30)
  2. 2 divides 30 (30 ÷ 2 = 15) → pair (2, 15)
  3. 3 divides 30 (30 ÷ 3 = 10) → pair (3, 10)
  4. 5 divides 30 (30 ÷ 5 = 6) → pair (5, 6)
  5. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 30} — total 8 divisors.
  6. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 = 72.

Nearby Examples

ndivisors countsum σ(n)
24860
36991
12628
4810124
6412
6012168
7212195
8412224

Related Operations for 30

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