Divisors of 55160: All 32 Factors

Quick Answer

55160 has 32 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 197, 280, 394, 788, 985, 1379, 1576, 1970, 2758, 3940, 5516, 6895, 7880, 11032, 13790, 27580, 55160.

Sum: 142560.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 197, 280, 394, 788, 985, 1379, 1576, 1970, 2758, 3940, 5516, 6895, 7880, 11032, 13790, 27580, 55160

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 55160

The number 55160 has 32 divisors:

1,  2,  4,  5,  7,  8,  10,  14,  20,  28,  35,  40,  56,  70,  140,  197,  280,  394,  788,  985,  1379,  1576,  1970,  2758,  3940,  5516,  6895,  7880,  11032,  13790,  27580,  55160

Divisor Pairs of 55160

Each pair multiplies to 55160:

Factor 1×Factor 2=Product
1×55160=55160
2×27580=55160
4×13790=55160
5×11032=55160
7×7880=55160
8×6895=55160
10×5516=55160
14×3940=55160
20×2758=55160
28×1970=55160
35×1576=55160
40×1379=55160
56×985=55160
70×788=55160
140×394=55160
197×280=55160

Number of Divisors

The number 55160 has 32 divisors, written as τ(55160) = 32 in number theory.

Sum of Divisors

σ(55160) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 140 + 197 + 280 + 394 + 788 + 985 + 1379 + 1576 + 1970 + 2758 + 3940 + 5516 + 6895 + 7880 + 11032 + 13790 + 27580 + 55160 = 142560

Properties of 55160

  • 55160 is composite.
  • 55160 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 142560.

Common Divisors with Another Number?

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

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

  1. 1 divides 55160 (55160 ÷ 1 = 55160) → pair (1, 55160)
  2. 2 divides 55160 (55160 ÷ 2 = 27580) → pair (2, 27580)
  3. 4 divides 55160 (55160 ÷ 4 = 13790) → pair (4, 13790)
  4. 5 divides 55160 (55160 ÷ 5 = 11032) → pair (5, 11032)
  5. 7 divides 55160 (55160 ÷ 7 = 7880) → pair (7, 7880)
  6. 8 divides 55160 (55160 ÷ 8 = 6895) → pair (8, 6895)
  7. 10 divides 55160 (55160 ÷ 10 = 5516) → pair (10, 5516)
  8. 14 divides 55160 (55160 ÷ 14 = 3940) → pair (14, 3940)
  9. 20 divides 55160 (55160 ÷ 20 = 2758) → pair (20, 2758)
  10. 28 divides 55160 (55160 ÷ 28 = 1970) → pair (28, 1970)
  11. 35 divides 55160 (55160 ÷ 35 = 1576) → pair (35, 1576)
  12. 40 divides 55160 (55160 ÷ 40 = 1379) → pair (40, 1379)
  13. 56 divides 55160 (55160 ÷ 56 = 985) → pair (56, 985)
  14. 70 divides 55160 (55160 ÷ 70 = 788) → pair (70, 788)
  15. 140 divides 55160 (55160 ÷ 140 = 394) → pair (140, 394)
  16. 197 divides 55160 (55160 ÷ 197 = 280) → pair (197, 280)
  17. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 197, 280, 394, 788, 985, 1379, 1576, 1970, 2758, 3940, 5516, 6895, 7880, 11032, 13790, 27580, 55160} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 140 + 197 + 280 + 394 + 788 + 985 + 1379 + 1576 + 1970 + 2758 + 3940 + 5516 + 6895 + 7880 + 11032 + 13790 + 27580 + 55160 = 142560.

Nearby Examples

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

Related Operations for 55160

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