Divisors of 3060: All 36 Factors

Quick Answer

3060 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 17, 18, 20, 30, 34, 36, 45, 51, 60, 68, 85, 90, 102, 153, 170, 180, 204, 255, 306, 340, 510, 612, 765, 1020, 1530, 3060.

Sum: 9828.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 17, 18, 20, 30, 34, 36, 45, 51, 60, 68, 85, 90, 102, 153, 170, 180, 204, 255, 306, 340, 510, 612, 765, 1020, 1530, 3060

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 3060

The number 3060 has 36 divisors:

1,  2,  3,  4,  5,  6,  9,  10,  12,  15,  17,  18,  20,  30,  34,  36,  45,  51,  60,  68,  85,  90,  102,  153,  170,  180,  204,  255,  306,  340,  510,  612,  765,  1020,  1530,  3060

Divisor Pairs of 3060

Each pair multiplies to 3060:

Factor 1×Factor 2=Product
1×3060=3060
2×1530=3060
3×1020=3060
4×765=3060
5×612=3060
6×510=3060
9×340=3060
10×306=3060
12×255=3060
15×204=3060
17×180=3060
18×170=3060
20×153=3060
30×102=3060
34×90=3060
36×85=3060
45×68=3060
51×60=3060

Number of Divisors

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

Sum of Divisors

σ(3060) = 1 + 2 + 3 + 4 + 5 + 6 + 9 + 10 + 12 + 15 + 17 + 18 + 20 + 30 + 34 + 36 + 45 + 51 + 60 + 68 + 85 + 90 + 102 + 153 + 170 + 180 + 204 + 255 + 306 + 340 + 510 + 612 + 765 + 1020 + 1530 + 3060 = 9828

Properties of 3060

  • 3060 is composite.
  • 3060 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 9828.

Common Divisors with Another Number?

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

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

  1. 1 divides 3060 (3060 ÷ 1 = 3060) → pair (1, 3060)
  2. 2 divides 3060 (3060 ÷ 2 = 1530) → pair (2, 1530)
  3. 3 divides 3060 (3060 ÷ 3 = 1020) → pair (3, 1020)
  4. 4 divides 3060 (3060 ÷ 4 = 765) → pair (4, 765)
  5. 5 divides 3060 (3060 ÷ 5 = 612) → pair (5, 612)
  6. 6 divides 3060 (3060 ÷ 6 = 510) → pair (6, 510)
  7. 9 divides 3060 (3060 ÷ 9 = 340) → pair (9, 340)
  8. 10 divides 3060 (3060 ÷ 10 = 306) → pair (10, 306)
  9. 12 divides 3060 (3060 ÷ 12 = 255) → pair (12, 255)
  10. 15 divides 3060 (3060 ÷ 15 = 204) → pair (15, 204)
  11. 17 divides 3060 (3060 ÷ 17 = 180) → pair (17, 180)
  12. 18 divides 3060 (3060 ÷ 18 = 170) → pair (18, 170)
  13. 20 divides 3060 (3060 ÷ 20 = 153) → pair (20, 153)
  14. 30 divides 3060 (3060 ÷ 30 = 102) → pair (30, 102)
  15. 34 divides 3060 (3060 ÷ 34 = 90) → pair (34, 90)
  16. 36 divides 3060 (3060 ÷ 36 = 85) → pair (36, 85)
  17. 45 divides 3060 (3060 ÷ 45 = 68) → pair (45, 68)
  18. 51 divides 3060 (3060 ÷ 51 = 60) → pair (51, 60)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 17, 18, 20, 30, 34, 36, 45, 51, 60, 68, 85, 90, 102, 153, 170, 180, 204, 255, 306, 340, 510, 612, 765, 1020, 1530, 3060} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 9 + 10 + 12 + 15 + 17 + 18 + 20 + 30 + 34 + 36 + 45 + 51 + 60 + 68 + 85 + 90 + 102 + 153 + 170 + 180 + 204 + 255 + 306 + 340 + 510 + 612 + 765 + 1020 + 1530 + 3060 = 9828.

Nearby Examples

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

Related Operations for 3060

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