Divisors of 26565: All 32 Factors

Quick Answer

26565 has 32 divisors (factors): 1, 3, 5, 7, 11, 15, 21, 23, 33, 35, 55, 69, 77, 105, 115, 161, 165, 231, 253, 345, 385, 483, 759, 805, 1155, 1265, 1771, 2415, 3795, 5313, 8855, 26565.

Sum: 55296.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 3, 5, 7, 11, 15, 21, 23, 33, 35, 55, 69, 77, 105, 115, 161, 165, 231, 253, 345, 385, 483, 759, 805, 1155, 1265, 1771, 2415, 3795, 5313, 8855, 26565

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 26565

The number 26565 has 32 divisors:

1,  3,  5,  7,  11,  15,  21,  23,  33,  35,  55,  69,  77,  105,  115,  161,  165,  231,  253,  345,  385,  483,  759,  805,  1155,  1265,  1771,  2415,  3795,  5313,  8855,  26565

Divisor Pairs of 26565

Each pair multiplies to 26565:

Factor 1×Factor 2=Product
1×26565=26565
3×8855=26565
5×5313=26565
7×3795=26565
11×2415=26565
15×1771=26565
21×1265=26565
23×1155=26565
33×805=26565
35×759=26565
55×483=26565
69×385=26565
77×345=26565
105×253=26565
115×231=26565
161×165=26565

Number of Divisors

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

Sum of Divisors

σ(26565) = 1 + 3 + 5 + 7 + 11 + 15 + 21 + 23 + 33 + 35 + 55 + 69 + 77 + 105 + 115 + 161 + 165 + 231 + 253 + 345 + 385 + 483 + 759 + 805 + 1155 + 1265 + 1771 + 2415 + 3795 + 5313 + 8855 + 26565 = 55296

Properties of 26565

  • 26565 is composite.
  • 26565 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 55296.

Common Divisors with Another Number?

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

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

  1. 1 divides 26565 (26565 ÷ 1 = 26565) → pair (1, 26565)
  2. 3 divides 26565 (26565 ÷ 3 = 8855) → pair (3, 8855)
  3. 5 divides 26565 (26565 ÷ 5 = 5313) → pair (5, 5313)
  4. 7 divides 26565 (26565 ÷ 7 = 3795) → pair (7, 3795)
  5. 11 divides 26565 (26565 ÷ 11 = 2415) → pair (11, 2415)
  6. 15 divides 26565 (26565 ÷ 15 = 1771) → pair (15, 1771)
  7. 21 divides 26565 (26565 ÷ 21 = 1265) → pair (21, 1265)
  8. 23 divides 26565 (26565 ÷ 23 = 1155) → pair (23, 1155)
  9. 33 divides 26565 (26565 ÷ 33 = 805) → pair (33, 805)
  10. 35 divides 26565 (26565 ÷ 35 = 759) → pair (35, 759)
  11. 55 divides 26565 (26565 ÷ 55 = 483) → pair (55, 483)
  12. 69 divides 26565 (26565 ÷ 69 = 385) → pair (69, 385)
  13. 77 divides 26565 (26565 ÷ 77 = 345) → pair (77, 345)
  14. 105 divides 26565 (26565 ÷ 105 = 253) → pair (105, 253)
  15. 115 divides 26565 (26565 ÷ 115 = 231) → pair (115, 231)
  16. 161 divides 26565 (26565 ÷ 161 = 165) → pair (161, 165)
  17. Collect all unique values: {1, 3, 5, 7, 11, 15, 21, 23, 33, 35, 55, 69, 77, 105, 115, 161, 165, 231, 253, 345, 385, 483, 759, 805, 1155, 1265, 1771, 2415, 3795, 5313, 8855, 26565} — total 32 divisors.
  18. Sum: 1 + 3 + 5 + 7 + 11 + 15 + 21 + 23 + 33 + 35 + 55 + 69 + 77 + 105 + 115 + 161 + 165 + 231 + 253 + 345 + 385 + 483 + 759 + 805 + 1155 + 1265 + 1771 + 2415 + 3795 + 5313 + 8855 + 26565 = 55296.

Nearby Examples

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

Related Operations for 26565

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