Divisors of 6160: All 40 Factors

Quick Answer

6160 has 40 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 35, 40, 44, 55, 56, 70, 77, 80, 88, 110, 112, 140, 154, 176, 220, 280, 308, 385, 440, 560, 616, 770, 880, 1232, 1540, 3080, 6160.

Sum: 17856.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 35, 40, 44, 55, 56, 70, 77, 80, 88, 110, 112, 140, 154, 176, 220, 280, 308, 385, 440, 560, 616, 770, 880, 1232, 1540, 3080, 6160

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 6160

The number 6160 has 40 divisors:

1,  2,  4,  5,  7,  8,  10,  11,  14,  16,  20,  22,  28,  35,  40,  44,  55,  56,  70,  77,  80,  88,  110,  112,  140,  154,  176,  220,  280,  308,  385,  440,  560,  616,  770,  880,  1232,  1540,  3080,  6160

Divisor Pairs of 6160

Each pair multiplies to 6160:

Factor 1×Factor 2=Product
1×6160=6160
2×3080=6160
4×1540=6160
5×1232=6160
7×880=6160
8×770=6160
10×616=6160
11×560=6160
14×440=6160
16×385=6160
20×308=6160
22×280=6160
28×220=6160
35×176=6160
40×154=6160
44×140=6160
55×112=6160
56×110=6160
70×88=6160
77×80=6160

Number of Divisors

The number 6160 has 40 divisors, written as τ(6160) = 40 in number theory.

Sum of Divisors

σ(6160) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 11 + 14 + 16 + 20 + 22 + 28 + 35 + 40 + 44 + 55 + 56 + 70 + 77 + 80 + 88 + 110 + 112 + 140 + 154 + 176 + 220 + 280 + 308 + 385 + 440 + 560 + 616 + 770 + 880 + 1232 + 1540 + 3080 + 6160 = 17856

Properties of 6160

  • 6160 is composite.
  • 6160 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 17856.

Common Divisors with Another Number?

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

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

  1. 1 divides 6160 (6160 ÷ 1 = 6160) → pair (1, 6160)
  2. 2 divides 6160 (6160 ÷ 2 = 3080) → pair (2, 3080)
  3. 4 divides 6160 (6160 ÷ 4 = 1540) → pair (4, 1540)
  4. 5 divides 6160 (6160 ÷ 5 = 1232) → pair (5, 1232)
  5. 7 divides 6160 (6160 ÷ 7 = 880) → pair (7, 880)
  6. 8 divides 6160 (6160 ÷ 8 = 770) → pair (8, 770)
  7. 10 divides 6160 (6160 ÷ 10 = 616) → pair (10, 616)
  8. 11 divides 6160 (6160 ÷ 11 = 560) → pair (11, 560)
  9. 14 divides 6160 (6160 ÷ 14 = 440) → pair (14, 440)
  10. 16 divides 6160 (6160 ÷ 16 = 385) → pair (16, 385)
  11. 20 divides 6160 (6160 ÷ 20 = 308) → pair (20, 308)
  12. 22 divides 6160 (6160 ÷ 22 = 280) → pair (22, 280)
  13. 28 divides 6160 (6160 ÷ 28 = 220) → pair (28, 220)
  14. 35 divides 6160 (6160 ÷ 35 = 176) → pair (35, 176)
  15. 40 divides 6160 (6160 ÷ 40 = 154) → pair (40, 154)
  16. 44 divides 6160 (6160 ÷ 44 = 140) → pair (44, 140)
  17. 55 divides 6160 (6160 ÷ 55 = 112) → pair (55, 112)
  18. 56 divides 6160 (6160 ÷ 56 = 110) → pair (56, 110)
  19. 70 divides 6160 (6160 ÷ 70 = 88) → pair (70, 88)
  20. 77 divides 6160 (6160 ÷ 77 = 80) → pair (77, 80)
  21. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 35, 40, 44, 55, 56, 70, 77, 80, 88, 110, 112, 140, 154, 176, 220, 280, 308, 385, 440, 560, 616, 770, 880, 1232, 1540, 3080, 6160} — total 40 divisors.
  22. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 11 + 14 + 16 + 20 + 22 + 28 + 35 + 40 + 44 + 55 + 56 + 70 + 77 + 80 + 88 + 110 + 112 + 140 + 154 + 176 + 220 + 280 + 308 + 385 + 440 + 560 + 616 + 770 + 880 + 1232 + 1540 + 3080 + 6160 = 17856.

Nearby Examples

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

Related Operations for 6160

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