Divisors of 1260: All 36 Factors

Quick Answer

1260 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28, 30, 35, 36, 42, 45, 60, 63, 70, 84, 90, 105, 126, 140, 180, 210, 252, 315, 420, 630, 1260.

Sum: 4368.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28, 30, 35, 36, 42, 45, 60, 63, 70, 84, 90, 105, 126, 140, 180, 210, 252, 315, 420, 630, 1260

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 1260

The number 1260 has 36 divisors:

1,  2,  3,  4,  5,  6,  7,  9,  10,  12,  14,  15,  18,  20,  21,  28,  30,  35,  36,  42,  45,  60,  63,  70,  84,  90,  105,  126,  140,  180,  210,  252,  315,  420,  630,  1260

Divisor Pairs of 1260

Each pair multiplies to 1260:

Factor 1×Factor 2=Product
1×1260=1260
2×630=1260
3×420=1260
4×315=1260
5×252=1260
6×210=1260
7×180=1260
9×140=1260
10×126=1260
12×105=1260
14×90=1260
15×84=1260
18×70=1260
20×63=1260
21×60=1260
28×45=1260
30×42=1260
35×36=1260

Number of Divisors

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

Sum of Divisors

σ(1260) = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 9 + 10 + 12 + 14 + 15 + 18 + 20 + 21 + 28 + 30 + 35 + 36 + 42 + 45 + 60 + 63 + 70 + 84 + 90 + 105 + 126 + 140 + 180 + 210 + 252 + 315 + 420 + 630 + 1260 = 4368

Properties of 1260

  • 1260 is composite.
  • 1260 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 4368.

Common Divisors with Another Number?

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

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

  1. 1 divides 1260 (1260 ÷ 1 = 1260) → pair (1, 1260)
  2. 2 divides 1260 (1260 ÷ 2 = 630) → pair (2, 630)
  3. 3 divides 1260 (1260 ÷ 3 = 420) → pair (3, 420)
  4. 4 divides 1260 (1260 ÷ 4 = 315) → pair (4, 315)
  5. 5 divides 1260 (1260 ÷ 5 = 252) → pair (5, 252)
  6. 6 divides 1260 (1260 ÷ 6 = 210) → pair (6, 210)
  7. 7 divides 1260 (1260 ÷ 7 = 180) → pair (7, 180)
  8. 9 divides 1260 (1260 ÷ 9 = 140) → pair (9, 140)
  9. 10 divides 1260 (1260 ÷ 10 = 126) → pair (10, 126)
  10. 12 divides 1260 (1260 ÷ 12 = 105) → pair (12, 105)
  11. 14 divides 1260 (1260 ÷ 14 = 90) → pair (14, 90)
  12. 15 divides 1260 (1260 ÷ 15 = 84) → pair (15, 84)
  13. 18 divides 1260 (1260 ÷ 18 = 70) → pair (18, 70)
  14. 20 divides 1260 (1260 ÷ 20 = 63) → pair (20, 63)
  15. 21 divides 1260 (1260 ÷ 21 = 60) → pair (21, 60)
  16. 28 divides 1260 (1260 ÷ 28 = 45) → pair (28, 45)
  17. 30 divides 1260 (1260 ÷ 30 = 42) → pair (30, 42)
  18. 35 divides 1260 (1260 ÷ 35 = 36) → pair (35, 36)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28, 30, 35, 36, 42, 45, 60, 63, 70, 84, 90, 105, 126, 140, 180, 210, 252, 315, 420, 630, 1260} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 7 + 9 + 10 + 12 + 14 + 15 + 18 + 20 + 21 + 28 + 30 + 35 + 36 + 42 + 45 + 60 + 63 + 70 + 84 + 90 + 105 + 126 + 140 + 180 + 210 + 252 + 315 + 420 + 630 + 1260 = 4368.

Nearby Examples

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

Related Operations for 1260

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