Divisors of 62080: All 32 Factors

Quick Answer

62080 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 97, 128, 160, 194, 320, 388, 485, 640, 776, 970, 1552, 1940, 3104, 3880, 6208, 7760, 12416, 15520, 31040, 62080.

Sum: 149940.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 97, 128, 160, 194, 320, 388, 485, 640, 776, 970, 1552, 1940, 3104, 3880, 6208, 7760, 12416, 15520, 31040, 62080

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 62080

The number 62080 has 32 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  32,  40,  64,  80,  97,  128,  160,  194,  320,  388,  485,  640,  776,  970,  1552,  1940,  3104,  3880,  6208,  7760,  12416,  15520,  31040,  62080

Divisor Pairs of 62080

Each pair multiplies to 62080:

Factor 1×Factor 2=Product
1×62080=62080
2×31040=62080
4×15520=62080
5×12416=62080
8×7760=62080
10×6208=62080
16×3880=62080
20×3104=62080
32×1940=62080
40×1552=62080
64×970=62080
80×776=62080
97×640=62080
128×485=62080
160×388=62080
194×320=62080

Number of Divisors

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

Sum of Divisors

σ(62080) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 97 + 128 + 160 + 194 + 320 + 388 + 485 + 640 + 776 + 970 + 1552 + 1940 + 3104 + 3880 + 6208 + 7760 + 12416 + 15520 + 31040 + 62080 = 149940

Properties of 62080

  • 62080 is composite.
  • 62080 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 149940.

Common Divisors with Another Number?

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

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

  1. 1 divides 62080 (62080 ÷ 1 = 62080) → pair (1, 62080)
  2. 2 divides 62080 (62080 ÷ 2 = 31040) → pair (2, 31040)
  3. 4 divides 62080 (62080 ÷ 4 = 15520) → pair (4, 15520)
  4. 5 divides 62080 (62080 ÷ 5 = 12416) → pair (5, 12416)
  5. 8 divides 62080 (62080 ÷ 8 = 7760) → pair (8, 7760)
  6. 10 divides 62080 (62080 ÷ 10 = 6208) → pair (10, 6208)
  7. 16 divides 62080 (62080 ÷ 16 = 3880) → pair (16, 3880)
  8. 20 divides 62080 (62080 ÷ 20 = 3104) → pair (20, 3104)
  9. 32 divides 62080 (62080 ÷ 32 = 1940) → pair (32, 1940)
  10. 40 divides 62080 (62080 ÷ 40 = 1552) → pair (40, 1552)
  11. 64 divides 62080 (62080 ÷ 64 = 970) → pair (64, 970)
  12. 80 divides 62080 (62080 ÷ 80 = 776) → pair (80, 776)
  13. 97 divides 62080 (62080 ÷ 97 = 640) → pair (97, 640)
  14. 128 divides 62080 (62080 ÷ 128 = 485) → pair (128, 485)
  15. 160 divides 62080 (62080 ÷ 160 = 388) → pair (160, 388)
  16. 194 divides 62080 (62080 ÷ 194 = 320) → pair (194, 320)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 97, 128, 160, 194, 320, 388, 485, 640, 776, 970, 1552, 1940, 3104, 3880, 6208, 7760, 12416, 15520, 31040, 62080} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 97 + 128 + 160 + 194 + 320 + 388 + 485 + 640 + 776 + 970 + 1552 + 1940 + 3104 + 3880 + 6208 + 7760 + 12416 + 15520 + 31040 + 62080 = 149940.

Nearby Examples

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

Related Operations for 62080

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