Divisors of 62064: All 30 Factors

Quick Answer

62064 has 30 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 431, 862, 1293, 1724, 2586, 3448, 3879, 5172, 6896, 7758, 10344, 15516, 20688, 31032, 62064.

Sum: 174096.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
30 divisors
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 431, 862, 1293, 1724, 2586, 3448, 3879, 5172, 6896, 7758, 10344, 15516, 20688, 31032, 62064

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 62064

The number 62064 has 30 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  16,  18,  24,  36,  48,  72,  144,  431,  862,  1293,  1724,  2586,  3448,  3879,  5172,  6896,  7758,  10344,  15516,  20688,  31032,  62064

Divisor Pairs of 62064

Each pair multiplies to 62064:

Factor 1×Factor 2=Product
1×62064=62064
2×31032=62064
3×20688=62064
4×15516=62064
6×10344=62064
8×7758=62064
9×6896=62064
12×5172=62064
16×3879=62064
18×3448=62064
24×2586=62064
36×1724=62064
48×1293=62064
72×862=62064
144×431=62064

Number of Divisors

The number 62064 has 30 divisors, written as τ(62064) = 30 in number theory.

Sum of Divisors

σ(62064) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 36 + 48 + 72 + 144 + 431 + 862 + 1293 + 1724 + 2586 + 3448 + 3879 + 5172 + 6896 + 7758 + 10344 + 15516 + 20688 + 31032 + 62064 = 174096

Properties of 62064

  • 62064 is composite.
  • 62064 is not a perfect square.
  • Number of divisors: 30.
  • Sum of divisors: 174096.

Common Divisors with Another Number?

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

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

  1. 1 divides 62064 (62064 ÷ 1 = 62064) → pair (1, 62064)
  2. 2 divides 62064 (62064 ÷ 2 = 31032) → pair (2, 31032)
  3. 3 divides 62064 (62064 ÷ 3 = 20688) → pair (3, 20688)
  4. 4 divides 62064 (62064 ÷ 4 = 15516) → pair (4, 15516)
  5. 6 divides 62064 (62064 ÷ 6 = 10344) → pair (6, 10344)
  6. 8 divides 62064 (62064 ÷ 8 = 7758) → pair (8, 7758)
  7. 9 divides 62064 (62064 ÷ 9 = 6896) → pair (9, 6896)
  8. 12 divides 62064 (62064 ÷ 12 = 5172) → pair (12, 5172)
  9. 16 divides 62064 (62064 ÷ 16 = 3879) → pair (16, 3879)
  10. 18 divides 62064 (62064 ÷ 18 = 3448) → pair (18, 3448)
  11. 24 divides 62064 (62064 ÷ 24 = 2586) → pair (24, 2586)
  12. 36 divides 62064 (62064 ÷ 36 = 1724) → pair (36, 1724)
  13. 48 divides 62064 (62064 ÷ 48 = 1293) → pair (48, 1293)
  14. 72 divides 62064 (62064 ÷ 72 = 862) → pair (72, 862)
  15. 144 divides 62064 (62064 ÷ 144 = 431) → pair (144, 431)
  16. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 431, 862, 1293, 1724, 2586, 3448, 3879, 5172, 6896, 7758, 10344, 15516, 20688, 31032, 62064} — total 30 divisors.
  17. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 36 + 48 + 72 + 144 + 431 + 862 + 1293 + 1724 + 2586 + 3448 + 3879 + 5172 + 6896 + 7758 + 10344 + 15516 + 20688 + 31032 + 62064 = 174096.

Nearby Examples

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

Related Operations for 62064

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