Divisors of 25960: All 32 Factors

Quick Answer

25960 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 11, 20, 22, 40, 44, 55, 59, 88, 110, 118, 220, 236, 295, 440, 472, 590, 649, 1180, 1298, 2360, 2596, 3245, 5192, 6490, 12980, 25960.

Sum: 64800.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 11, 20, 22, 40, 44, 55, 59, 88, 110, 118, 220, 236, 295, 440, 472, 590, 649, 1180, 1298, 2360, 2596, 3245, 5192, 6490, 12980, 25960

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 25960

The number 25960 has 32 divisors:

1,  2,  4,  5,  8,  10,  11,  20,  22,  40,  44,  55,  59,  88,  110,  118,  220,  236,  295,  440,  472,  590,  649,  1180,  1298,  2360,  2596,  3245,  5192,  6490,  12980,  25960

Divisor Pairs of 25960

Each pair multiplies to 25960:

Factor 1×Factor 2=Product
1×25960=25960
2×12980=25960
4×6490=25960
5×5192=25960
8×3245=25960
10×2596=25960
11×2360=25960
20×1298=25960
22×1180=25960
40×649=25960
44×590=25960
55×472=25960
59×440=25960
88×295=25960
110×236=25960
118×220=25960

Number of Divisors

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

Sum of Divisors

σ(25960) = 1 + 2 + 4 + 5 + 8 + 10 + 11 + 20 + 22 + 40 + 44 + 55 + 59 + 88 + 110 + 118 + 220 + 236 + 295 + 440 + 472 + 590 + 649 + 1180 + 1298 + 2360 + 2596 + 3245 + 5192 + 6490 + 12980 + 25960 = 64800

Properties of 25960

  • 25960 is composite.
  • 25960 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 64800.

Common Divisors with Another Number?

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

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

  1. 1 divides 25960 (25960 ÷ 1 = 25960) → pair (1, 25960)
  2. 2 divides 25960 (25960 ÷ 2 = 12980) → pair (2, 12980)
  3. 4 divides 25960 (25960 ÷ 4 = 6490) → pair (4, 6490)
  4. 5 divides 25960 (25960 ÷ 5 = 5192) → pair (5, 5192)
  5. 8 divides 25960 (25960 ÷ 8 = 3245) → pair (8, 3245)
  6. 10 divides 25960 (25960 ÷ 10 = 2596) → pair (10, 2596)
  7. 11 divides 25960 (25960 ÷ 11 = 2360) → pair (11, 2360)
  8. 20 divides 25960 (25960 ÷ 20 = 1298) → pair (20, 1298)
  9. 22 divides 25960 (25960 ÷ 22 = 1180) → pair (22, 1180)
  10. 40 divides 25960 (25960 ÷ 40 = 649) → pair (40, 649)
  11. 44 divides 25960 (25960 ÷ 44 = 590) → pair (44, 590)
  12. 55 divides 25960 (25960 ÷ 55 = 472) → pair (55, 472)
  13. 59 divides 25960 (25960 ÷ 59 = 440) → pair (59, 440)
  14. 88 divides 25960 (25960 ÷ 88 = 295) → pair (88, 295)
  15. 110 divides 25960 (25960 ÷ 110 = 236) → pair (110, 236)
  16. 118 divides 25960 (25960 ÷ 118 = 220) → pair (118, 220)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 11, 20, 22, 40, 44, 55, 59, 88, 110, 118, 220, 236, 295, 440, 472, 590, 649, 1180, 1298, 2360, 2596, 3245, 5192, 6490, 12980, 25960} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 11 + 20 + 22 + 40 + 44 + 55 + 59 + 88 + 110 + 118 + 220 + 236 + 295 + 440 + 472 + 590 + 649 + 1180 + 1298 + 2360 + 2596 + 3245 + 5192 + 6490 + 12980 + 25960 = 64800.

Nearby Examples

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

Related Operations for 25960

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