Divisors of 50560: All 32 Factors

Quick Answer

50560 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 79, 80, 128, 158, 160, 316, 320, 395, 632, 640, 790, 1264, 1580, 2528, 3160, 5056, 6320, 10112, 12640, 25280, 50560.

Sum: 122400.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 79, 80, 128, 158, 160, 316, 320, 395, 632, 640, 790, 1264, 1580, 2528, 3160, 5056, 6320, 10112, 12640, 25280, 50560

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 50560

The number 50560 has 32 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  32,  40,  64,  79,  80,  128,  158,  160,  316,  320,  395,  632,  640,  790,  1264,  1580,  2528,  3160,  5056,  6320,  10112,  12640,  25280,  50560

Divisor Pairs of 50560

Each pair multiplies to 50560:

Factor 1×Factor 2=Product
1×50560=50560
2×25280=50560
4×12640=50560
5×10112=50560
8×6320=50560
10×5056=50560
16×3160=50560
20×2528=50560
32×1580=50560
40×1264=50560
64×790=50560
79×640=50560
80×632=50560
128×395=50560
158×320=50560
160×316=50560

Number of Divisors

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

Sum of Divisors

σ(50560) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 79 + 80 + 128 + 158 + 160 + 316 + 320 + 395 + 632 + 640 + 790 + 1264 + 1580 + 2528 + 3160 + 5056 + 6320 + 10112 + 12640 + 25280 + 50560 = 122400

Properties of 50560

  • 50560 is composite.
  • 50560 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 122400.

Common Divisors with Another Number?

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

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

  1. 1 divides 50560 (50560 ÷ 1 = 50560) → pair (1, 50560)
  2. 2 divides 50560 (50560 ÷ 2 = 25280) → pair (2, 25280)
  3. 4 divides 50560 (50560 ÷ 4 = 12640) → pair (4, 12640)
  4. 5 divides 50560 (50560 ÷ 5 = 10112) → pair (5, 10112)
  5. 8 divides 50560 (50560 ÷ 8 = 6320) → pair (8, 6320)
  6. 10 divides 50560 (50560 ÷ 10 = 5056) → pair (10, 5056)
  7. 16 divides 50560 (50560 ÷ 16 = 3160) → pair (16, 3160)
  8. 20 divides 50560 (50560 ÷ 20 = 2528) → pair (20, 2528)
  9. 32 divides 50560 (50560 ÷ 32 = 1580) → pair (32, 1580)
  10. 40 divides 50560 (50560 ÷ 40 = 1264) → pair (40, 1264)
  11. 64 divides 50560 (50560 ÷ 64 = 790) → pair (64, 790)
  12. 79 divides 50560 (50560 ÷ 79 = 640) → pair (79, 640)
  13. 80 divides 50560 (50560 ÷ 80 = 632) → pair (80, 632)
  14. 128 divides 50560 (50560 ÷ 128 = 395) → pair (128, 395)
  15. 158 divides 50560 (50560 ÷ 158 = 320) → pair (158, 320)
  16. 160 divides 50560 (50560 ÷ 160 = 316) → pair (160, 316)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 79, 80, 128, 158, 160, 316, 320, 395, 632, 640, 790, 1264, 1580, 2528, 3160, 5056, 6320, 10112, 12640, 25280, 50560} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 79 + 80 + 128 + 158 + 160 + 316 + 320 + 395 + 632 + 640 + 790 + 1264 + 1580 + 2528 + 3160 + 5056 + 6320 + 10112 + 12640 + 25280 + 50560 = 122400.

Nearby Examples

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

Related Operations for 50560

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