Divisors of 26190: All 32 Factors

Quick Answer

26190 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 97, 135, 194, 270, 291, 485, 582, 873, 970, 1455, 1746, 2619, 2910, 4365, 5238, 8730, 13095, 26190.

Sum: 70560.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 97, 135, 194, 270, 291, 485, 582, 873, 970, 1455, 1746, 2619, 2910, 4365, 5238, 8730, 13095, 26190

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 26190

The number 26190 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  90,  97,  135,  194,  270,  291,  485,  582,  873,  970,  1455,  1746,  2619,  2910,  4365,  5238,  8730,  13095,  26190

Divisor Pairs of 26190

Each pair multiplies to 26190:

Factor 1×Factor 2=Product
1×26190=26190
2×13095=26190
3×8730=26190
5×5238=26190
6×4365=26190
9×2910=26190
10×2619=26190
15×1746=26190
18×1455=26190
27×970=26190
30×873=26190
45×582=26190
54×485=26190
90×291=26190
97×270=26190
135×194=26190

Number of Divisors

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

Sum of Divisors

σ(26190) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 97 + 135 + 194 + 270 + 291 + 485 + 582 + 873 + 970 + 1455 + 1746 + 2619 + 2910 + 4365 + 5238 + 8730 + 13095 + 26190 = 70560

Properties of 26190

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

Common Divisors with Another Number?

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

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

  1. 1 divides 26190 (26190 ÷ 1 = 26190) → pair (1, 26190)
  2. 2 divides 26190 (26190 ÷ 2 = 13095) → pair (2, 13095)
  3. 3 divides 26190 (26190 ÷ 3 = 8730) → pair (3, 8730)
  4. 5 divides 26190 (26190 ÷ 5 = 5238) → pair (5, 5238)
  5. 6 divides 26190 (26190 ÷ 6 = 4365) → pair (6, 4365)
  6. 9 divides 26190 (26190 ÷ 9 = 2910) → pair (9, 2910)
  7. 10 divides 26190 (26190 ÷ 10 = 2619) → pair (10, 2619)
  8. 15 divides 26190 (26190 ÷ 15 = 1746) → pair (15, 1746)
  9. 18 divides 26190 (26190 ÷ 18 = 1455) → pair (18, 1455)
  10. 27 divides 26190 (26190 ÷ 27 = 970) → pair (27, 970)
  11. 30 divides 26190 (26190 ÷ 30 = 873) → pair (30, 873)
  12. 45 divides 26190 (26190 ÷ 45 = 582) → pair (45, 582)
  13. 54 divides 26190 (26190 ÷ 54 = 485) → pair (54, 485)
  14. 90 divides 26190 (26190 ÷ 90 = 291) → pair (90, 291)
  15. 97 divides 26190 (26190 ÷ 97 = 270) → pair (97, 270)
  16. 135 divides 26190 (26190 ÷ 135 = 194) → pair (135, 194)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 97, 135, 194, 270, 291, 485, 582, 873, 970, 1455, 1746, 2619, 2910, 4365, 5238, 8730, 13095, 26190} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 97 + 135 + 194 + 270 + 291 + 485 + 582 + 873 + 970 + 1455 + 1746 + 2619 + 2910 + 4365 + 5238 + 8730 + 13095 + 26190 = 70560.

Nearby Examples

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

Related Operations for 26190

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