Divisors of 60288: All 32 Factors

Quick Answer

60288 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 157, 192, 314, 384, 471, 628, 942, 1256, 1884, 2512, 3768, 5024, 7536, 10048, 15072, 20096, 30144, 60288.

Sum: 161160.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 157, 192, 314, 384, 471, 628, 942, 1256, 1884, 2512, 3768, 5024, 7536, 10048, 15072, 20096, 30144, 60288

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 60288

The number 60288 has 32 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  96,  128,  157,  192,  314,  384,  471,  628,  942,  1256,  1884,  2512,  3768,  5024,  7536,  10048,  15072,  20096,  30144,  60288

Divisor Pairs of 60288

Each pair multiplies to 60288:

Factor 1×Factor 2=Product
1×60288=60288
2×30144=60288
3×20096=60288
4×15072=60288
6×10048=60288
8×7536=60288
12×5024=60288
16×3768=60288
24×2512=60288
32×1884=60288
48×1256=60288
64×942=60288
96×628=60288
128×471=60288
157×384=60288
192×314=60288

Number of Divisors

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

Sum of Divisors

σ(60288) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 128 + 157 + 192 + 314 + 384 + 471 + 628 + 942 + 1256 + 1884 + 2512 + 3768 + 5024 + 7536 + 10048 + 15072 + 20096 + 30144 + 60288 = 161160

Properties of 60288

  • 60288 is composite.
  • 60288 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 161160.

Common Divisors with Another Number?

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

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

  1. 1 divides 60288 (60288 ÷ 1 = 60288) → pair (1, 60288)
  2. 2 divides 60288 (60288 ÷ 2 = 30144) → pair (2, 30144)
  3. 3 divides 60288 (60288 ÷ 3 = 20096) → pair (3, 20096)
  4. 4 divides 60288 (60288 ÷ 4 = 15072) → pair (4, 15072)
  5. 6 divides 60288 (60288 ÷ 6 = 10048) → pair (6, 10048)
  6. 8 divides 60288 (60288 ÷ 8 = 7536) → pair (8, 7536)
  7. 12 divides 60288 (60288 ÷ 12 = 5024) → pair (12, 5024)
  8. 16 divides 60288 (60288 ÷ 16 = 3768) → pair (16, 3768)
  9. 24 divides 60288 (60288 ÷ 24 = 2512) → pair (24, 2512)
  10. 32 divides 60288 (60288 ÷ 32 = 1884) → pair (32, 1884)
  11. 48 divides 60288 (60288 ÷ 48 = 1256) → pair (48, 1256)
  12. 64 divides 60288 (60288 ÷ 64 = 942) → pair (64, 942)
  13. 96 divides 60288 (60288 ÷ 96 = 628) → pair (96, 628)
  14. 128 divides 60288 (60288 ÷ 128 = 471) → pair (128, 471)
  15. 157 divides 60288 (60288 ÷ 157 = 384) → pair (157, 384)
  16. 192 divides 60288 (60288 ÷ 192 = 314) → pair (192, 314)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 157, 192, 314, 384, 471, 628, 942, 1256, 1884, 2512, 3768, 5024, 7536, 10048, 15072, 20096, 30144, 60288} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 128 + 157 + 192 + 314 + 384 + 471 + 628 + 942 + 1256 + 1884 + 2512 + 3768 + 5024 + 7536 + 10048 + 15072 + 20096 + 30144 + 60288 = 161160.

Nearby Examples

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

Related Operations for 60288

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