Divisors of 27160: All 32 Factors

Quick Answer

27160 has 32 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 97, 140, 194, 280, 388, 485, 679, 776, 970, 1358, 1940, 2716, 3395, 3880, 5432, 6790, 13580, 27160.

Sum: 70560.

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, 97, 140, 194, 280, 388, 485, 679, 776, 970, 1358, 1940, 2716, 3395, 3880, 5432, 6790, 13580, 27160

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 27160

The number 27160 has 32 divisors:

1,  2,  4,  5,  7,  8,  10,  14,  20,  28,  35,  40,  56,  70,  97,  140,  194,  280,  388,  485,  679,  776,  970,  1358,  1940,  2716,  3395,  3880,  5432,  6790,  13580,  27160

Divisor Pairs of 27160

Each pair multiplies to 27160:

Factor 1×Factor 2=Product
1×27160=27160
2×13580=27160
4×6790=27160
5×5432=27160
7×3880=27160
8×3395=27160
10×2716=27160
14×1940=27160
20×1358=27160
28×970=27160
35×776=27160
40×679=27160
56×485=27160
70×388=27160
97×280=27160
140×194=27160

Number of Divisors

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

Sum of Divisors

σ(27160) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 97 + 140 + 194 + 280 + 388 + 485 + 679 + 776 + 970 + 1358 + 1940 + 2716 + 3395 + 3880 + 5432 + 6790 + 13580 + 27160 = 70560

Properties of 27160

  • 27160 is composite.
  • 27160 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 70560.

Common Divisors with Another Number?

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

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

  1. 1 divides 27160 (27160 ÷ 1 = 27160) → pair (1, 27160)
  2. 2 divides 27160 (27160 ÷ 2 = 13580) → pair (2, 13580)
  3. 4 divides 27160 (27160 ÷ 4 = 6790) → pair (4, 6790)
  4. 5 divides 27160 (27160 ÷ 5 = 5432) → pair (5, 5432)
  5. 7 divides 27160 (27160 ÷ 7 = 3880) → pair (7, 3880)
  6. 8 divides 27160 (27160 ÷ 8 = 3395) → pair (8, 3395)
  7. 10 divides 27160 (27160 ÷ 10 = 2716) → pair (10, 2716)
  8. 14 divides 27160 (27160 ÷ 14 = 1940) → pair (14, 1940)
  9. 20 divides 27160 (27160 ÷ 20 = 1358) → pair (20, 1358)
  10. 28 divides 27160 (27160 ÷ 28 = 970) → pair (28, 970)
  11. 35 divides 27160 (27160 ÷ 35 = 776) → pair (35, 776)
  12. 40 divides 27160 (27160 ÷ 40 = 679) → pair (40, 679)
  13. 56 divides 27160 (27160 ÷ 56 = 485) → pair (56, 485)
  14. 70 divides 27160 (27160 ÷ 70 = 388) → pair (70, 388)
  15. 97 divides 27160 (27160 ÷ 97 = 280) → pair (97, 280)
  16. 140 divides 27160 (27160 ÷ 140 = 194) → pair (140, 194)
  17. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 97, 140, 194, 280, 388, 485, 679, 776, 970, 1358, 1940, 2716, 3395, 3880, 5432, 6790, 13580, 27160} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 97 + 140 + 194 + 280 + 388 + 485 + 679 + 776 + 970 + 1358 + 1940 + 2716 + 3395 + 3880 + 5432 + 6790 + 13580 + 27160 = 70560.

Nearby Examples

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

Related Operations for 27160

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