Divisors of 56960: All 32 Factors

Quick Answer

56960 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 89, 128, 160, 178, 320, 356, 445, 640, 712, 890, 1424, 1780, 2848, 3560, 5696, 7120, 11392, 14240, 28480, 56960.

Sum: 137700.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 89, 128, 160, 178, 320, 356, 445, 640, 712, 890, 1424, 1780, 2848, 3560, 5696, 7120, 11392, 14240, 28480, 56960

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 56960

The number 56960 has 32 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  32,  40,  64,  80,  89,  128,  160,  178,  320,  356,  445,  640,  712,  890,  1424,  1780,  2848,  3560,  5696,  7120,  11392,  14240,  28480,  56960

Divisor Pairs of 56960

Each pair multiplies to 56960:

Factor 1×Factor 2=Product
1×56960=56960
2×28480=56960
4×14240=56960
5×11392=56960
8×7120=56960
10×5696=56960
16×3560=56960
20×2848=56960
32×1780=56960
40×1424=56960
64×890=56960
80×712=56960
89×640=56960
128×445=56960
160×356=56960
178×320=56960

Number of Divisors

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

Sum of Divisors

σ(56960) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 89 + 128 + 160 + 178 + 320 + 356 + 445 + 640 + 712 + 890 + 1424 + 1780 + 2848 + 3560 + 5696 + 7120 + 11392 + 14240 + 28480 + 56960 = 137700

Properties of 56960

  • 56960 is composite.
  • 56960 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 137700.

Common Divisors with Another Number?

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

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

  1. 1 divides 56960 (56960 ÷ 1 = 56960) → pair (1, 56960)
  2. 2 divides 56960 (56960 ÷ 2 = 28480) → pair (2, 28480)
  3. 4 divides 56960 (56960 ÷ 4 = 14240) → pair (4, 14240)
  4. 5 divides 56960 (56960 ÷ 5 = 11392) → pair (5, 11392)
  5. 8 divides 56960 (56960 ÷ 8 = 7120) → pair (8, 7120)
  6. 10 divides 56960 (56960 ÷ 10 = 5696) → pair (10, 5696)
  7. 16 divides 56960 (56960 ÷ 16 = 3560) → pair (16, 3560)
  8. 20 divides 56960 (56960 ÷ 20 = 2848) → pair (20, 2848)
  9. 32 divides 56960 (56960 ÷ 32 = 1780) → pair (32, 1780)
  10. 40 divides 56960 (56960 ÷ 40 = 1424) → pair (40, 1424)
  11. 64 divides 56960 (56960 ÷ 64 = 890) → pair (64, 890)
  12. 80 divides 56960 (56960 ÷ 80 = 712) → pair (80, 712)
  13. 89 divides 56960 (56960 ÷ 89 = 640) → pair (89, 640)
  14. 128 divides 56960 (56960 ÷ 128 = 445) → pair (128, 445)
  15. 160 divides 56960 (56960 ÷ 160 = 356) → pair (160, 356)
  16. 178 divides 56960 (56960 ÷ 178 = 320) → pair (178, 320)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 89, 128, 160, 178, 320, 356, 445, 640, 712, 890, 1424, 1780, 2848, 3560, 5696, 7120, 11392, 14240, 28480, 56960} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 89 + 128 + 160 + 178 + 320 + 356 + 445 + 640 + 712 + 890 + 1424 + 1780 + 2848 + 3560 + 5696 + 7120 + 11392 + 14240 + 28480 + 56960 = 137700.

Nearby Examples

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

Related Operations for 56960

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