Divisors of 60672: All 36 Factors

Quick Answer

60672 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 256, 316, 384, 474, 632, 768, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 20224, 30336, 60672.

Sum: 163520.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 256, 316, 384, 474, 632, 768, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 20224, 30336, 60672

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 60672

The number 60672 has 36 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  79,  96,  128,  158,  192,  237,  256,  316,  384,  474,  632,  768,  948,  1264,  1896,  2528,  3792,  5056,  7584,  10112,  15168,  20224,  30336,  60672

Divisor Pairs of 60672

Each pair multiplies to 60672:

Factor 1×Factor 2=Product
1×60672=60672
2×30336=60672
3×20224=60672
4×15168=60672
6×10112=60672
8×7584=60672
12×5056=60672
16×3792=60672
24×2528=60672
32×1896=60672
48×1264=60672
64×948=60672
79×768=60672
96×632=60672
128×474=60672
158×384=60672
192×316=60672
237×256=60672

Number of Divisors

The number 60672 has 36 divisors, written as τ(60672) = 36 in number theory.

Sum of Divisors

σ(60672) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 79 + 96 + 128 + 158 + 192 + 237 + 256 + 316 + 384 + 474 + 632 + 768 + 948 + 1264 + 1896 + 2528 + 3792 + 5056 + 7584 + 10112 + 15168 + 20224 + 30336 + 60672 = 163520

Properties of 60672

  • 60672 is composite.
  • 60672 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 163520.

Common Divisors with Another Number?

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

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

  1. 1 divides 60672 (60672 ÷ 1 = 60672) → pair (1, 60672)
  2. 2 divides 60672 (60672 ÷ 2 = 30336) → pair (2, 30336)
  3. 3 divides 60672 (60672 ÷ 3 = 20224) → pair (3, 20224)
  4. 4 divides 60672 (60672 ÷ 4 = 15168) → pair (4, 15168)
  5. 6 divides 60672 (60672 ÷ 6 = 10112) → pair (6, 10112)
  6. 8 divides 60672 (60672 ÷ 8 = 7584) → pair (8, 7584)
  7. 12 divides 60672 (60672 ÷ 12 = 5056) → pair (12, 5056)
  8. 16 divides 60672 (60672 ÷ 16 = 3792) → pair (16, 3792)
  9. 24 divides 60672 (60672 ÷ 24 = 2528) → pair (24, 2528)
  10. 32 divides 60672 (60672 ÷ 32 = 1896) → pair (32, 1896)
  11. 48 divides 60672 (60672 ÷ 48 = 1264) → pair (48, 1264)
  12. 64 divides 60672 (60672 ÷ 64 = 948) → pair (64, 948)
  13. 79 divides 60672 (60672 ÷ 79 = 768) → pair (79, 768)
  14. 96 divides 60672 (60672 ÷ 96 = 632) → pair (96, 632)
  15. 128 divides 60672 (60672 ÷ 128 = 474) → pair (128, 474)
  16. 158 divides 60672 (60672 ÷ 158 = 384) → pair (158, 384)
  17. 192 divides 60672 (60672 ÷ 192 = 316) → pair (192, 316)
  18. 237 divides 60672 (60672 ÷ 237 = 256) → pair (237, 256)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 256, 316, 384, 474, 632, 768, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 20224, 30336, 60672} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 79 + 96 + 128 + 158 + 192 + 237 + 256 + 316 + 384 + 474 + 632 + 768 + 948 + 1264 + 1896 + 2528 + 3792 + 5056 + 7584 + 10112 + 15168 + 20224 + 30336 + 60672 = 163520.

Nearby Examples

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

Related Operations for 60672

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