Divisors of 5910: All 16 Factors

Quick Answer

5910 has 16 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 30, 197, 394, 591, 985, 1182, 1970, 2955, 5910.

Sum: 14256.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
16 divisors
1, 2, 3, 5, 6, 10, 15, 30, 197, 394, 591, 985, 1182, 1970, 2955, 5910

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 5910

The number 5910 has 16 divisors:

1,  2,  3,  5,  6,  10,  15,  30,  197,  394,  591,  985,  1182,  1970,  2955,  5910

Divisor Pairs of 5910

Each pair multiplies to 5910:

Factor 1×Factor 2=Product
1×5910=5910
2×2955=5910
3×1970=5910
5×1182=5910
6×985=5910
10×591=5910
15×394=5910
30×197=5910

Number of Divisors

The number 5910 has 16 divisors, written as τ(5910) = 16 in number theory.

Sum of Divisors

σ(5910) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 + 197 + 394 + 591 + 985 + 1182 + 1970 + 2955 + 5910 = 14256

Properties of 5910

  • 5910 is composite.
  • 5910 is not a perfect square.
  • Number of divisors: 16.
  • Sum of divisors: 14256.

Common Divisors with Another Number?

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

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

  1. 1 divides 5910 (5910 ÷ 1 = 5910) → pair (1, 5910)
  2. 2 divides 5910 (5910 ÷ 2 = 2955) → pair (2, 2955)
  3. 3 divides 5910 (5910 ÷ 3 = 1970) → pair (3, 1970)
  4. 5 divides 5910 (5910 ÷ 5 = 1182) → pair (5, 1182)
  5. 6 divides 5910 (5910 ÷ 6 = 985) → pair (6, 985)
  6. 10 divides 5910 (5910 ÷ 10 = 591) → pair (10, 591)
  7. 15 divides 5910 (5910 ÷ 15 = 394) → pair (15, 394)
  8. 30 divides 5910 (5910 ÷ 30 = 197) → pair (30, 197)
  9. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 30, 197, 394, 591, 985, 1182, 1970, 2955, 5910} — total 16 divisors.
  10. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 + 197 + 394 + 591 + 985 + 1182 + 1970 + 2955 + 5910 = 14256.

Nearby Examples

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

Related Operations for 5910

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