Divisors of 3150: All 36 Factors

Quick Answer

3150 has 36 divisors (factors): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 25, 30, 35, 42, 45, 50, 63, 70, 75, 90, 105, 126, 150, 175, 210, 225, 315, 350, 450, 525, 630, 1050, 1575, 3150.

Sum: 9672.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 25, 30, 35, 42, 45, 50, 63, 70, 75, 90, 105, 126, 150, 175, 210, 225, 315, 350, 450, 525, 630, 1050, 1575, 3150

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 3150

The number 3150 has 36 divisors:

1,  2,  3,  5,  6,  7,  9,  10,  14,  15,  18,  21,  25,  30,  35,  42,  45,  50,  63,  70,  75,  90,  105,  126,  150,  175,  210,  225,  315,  350,  450,  525,  630,  1050,  1575,  3150

Divisor Pairs of 3150

Each pair multiplies to 3150:

Factor 1×Factor 2=Product
1×3150=3150
2×1575=3150
3×1050=3150
5×630=3150
6×525=3150
7×450=3150
9×350=3150
10×315=3150
14×225=3150
15×210=3150
18×175=3150
21×150=3150
25×126=3150
30×105=3150
35×90=3150
42×75=3150
45×70=3150
50×63=3150

Number of Divisors

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

Sum of Divisors

σ(3150) = 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 14 + 15 + 18 + 21 + 25 + 30 + 35 + 42 + 45 + 50 + 63 + 70 + 75 + 90 + 105 + 126 + 150 + 175 + 210 + 225 + 315 + 350 + 450 + 525 + 630 + 1050 + 1575 + 3150 = 9672

Properties of 3150

  • 3150 is composite.
  • 3150 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 9672.

Common Divisors with Another Number?

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

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

  1. 1 divides 3150 (3150 ÷ 1 = 3150) → pair (1, 3150)
  2. 2 divides 3150 (3150 ÷ 2 = 1575) → pair (2, 1575)
  3. 3 divides 3150 (3150 ÷ 3 = 1050) → pair (3, 1050)
  4. 5 divides 3150 (3150 ÷ 5 = 630) → pair (5, 630)
  5. 6 divides 3150 (3150 ÷ 6 = 525) → pair (6, 525)
  6. 7 divides 3150 (3150 ÷ 7 = 450) → pair (7, 450)
  7. 9 divides 3150 (3150 ÷ 9 = 350) → pair (9, 350)
  8. 10 divides 3150 (3150 ÷ 10 = 315) → pair (10, 315)
  9. 14 divides 3150 (3150 ÷ 14 = 225) → pair (14, 225)
  10. 15 divides 3150 (3150 ÷ 15 = 210) → pair (15, 210)
  11. 18 divides 3150 (3150 ÷ 18 = 175) → pair (18, 175)
  12. 21 divides 3150 (3150 ÷ 21 = 150) → pair (21, 150)
  13. 25 divides 3150 (3150 ÷ 25 = 126) → pair (25, 126)
  14. 30 divides 3150 (3150 ÷ 30 = 105) → pair (30, 105)
  15. 35 divides 3150 (3150 ÷ 35 = 90) → pair (35, 90)
  16. 42 divides 3150 (3150 ÷ 42 = 75) → pair (42, 75)
  17. 45 divides 3150 (3150 ÷ 45 = 70) → pair (45, 70)
  18. 50 divides 3150 (3150 ÷ 50 = 63) → pair (50, 63)
  19. Collect all unique values: {1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 25, 30, 35, 42, 45, 50, 63, 70, 75, 90, 105, 126, 150, 175, 210, 225, 315, 350, 450, 525, 630, 1050, 1575, 3150} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 14 + 15 + 18 + 21 + 25 + 30 + 35 + 42 + 45 + 50 + 63 + 70 + 75 + 90 + 105 + 126 + 150 + 175 + 210 + 225 + 315 + 350 + 450 + 525 + 630 + 1050 + 1575 + 3150 = 9672.

Nearby Examples

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

Related Operations for 3150

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