Divisors of 20608: All 32 Factors

Quick Answer

20608 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 23, 28, 32, 46, 56, 64, 92, 112, 128, 161, 184, 224, 322, 368, 448, 644, 736, 896, 1288, 1472, 2576, 2944, 5152, 10304, 20608.

Sum: 48960.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 7, 8, 14, 16, 23, 28, 32, 46, 56, 64, 92, 112, 128, 161, 184, 224, 322, 368, 448, 644, 736, 896, 1288, 1472, 2576, 2944, 5152, 10304, 20608

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 20608

The number 20608 has 32 divisors:

1,  2,  4,  7,  8,  14,  16,  23,  28,  32,  46,  56,  64,  92,  112,  128,  161,  184,  224,  322,  368,  448,  644,  736,  896,  1288,  1472,  2576,  2944,  5152,  10304,  20608

Divisor Pairs of 20608

Each pair multiplies to 20608:

Factor 1×Factor 2=Product
1×20608=20608
2×10304=20608
4×5152=20608
7×2944=20608
8×2576=20608
14×1472=20608
16×1288=20608
23×896=20608
28×736=20608
32×644=20608
46×448=20608
56×368=20608
64×322=20608
92×224=20608
112×184=20608
128×161=20608

Number of Divisors

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

Sum of Divisors

σ(20608) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 23 + 28 + 32 + 46 + 56 + 64 + 92 + 112 + 128 + 161 + 184 + 224 + 322 + 368 + 448 + 644 + 736 + 896 + 1288 + 1472 + 2576 + 2944 + 5152 + 10304 + 20608 = 48960

Properties of 20608

  • 20608 is composite.
  • 20608 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 48960.

Common Divisors with Another Number?

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

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

  1. 1 divides 20608 (20608 ÷ 1 = 20608) → pair (1, 20608)
  2. 2 divides 20608 (20608 ÷ 2 = 10304) → pair (2, 10304)
  3. 4 divides 20608 (20608 ÷ 4 = 5152) → pair (4, 5152)
  4. 7 divides 20608 (20608 ÷ 7 = 2944) → pair (7, 2944)
  5. 8 divides 20608 (20608 ÷ 8 = 2576) → pair (8, 2576)
  6. 14 divides 20608 (20608 ÷ 14 = 1472) → pair (14, 1472)
  7. 16 divides 20608 (20608 ÷ 16 = 1288) → pair (16, 1288)
  8. 23 divides 20608 (20608 ÷ 23 = 896) → pair (23, 896)
  9. 28 divides 20608 (20608 ÷ 28 = 736) → pair (28, 736)
  10. 32 divides 20608 (20608 ÷ 32 = 644) → pair (32, 644)
  11. 46 divides 20608 (20608 ÷ 46 = 448) → pair (46, 448)
  12. 56 divides 20608 (20608 ÷ 56 = 368) → pair (56, 368)
  13. 64 divides 20608 (20608 ÷ 64 = 322) → pair (64, 322)
  14. 92 divides 20608 (20608 ÷ 92 = 224) → pair (92, 224)
  15. 112 divides 20608 (20608 ÷ 112 = 184) → pair (112, 184)
  16. 128 divides 20608 (20608 ÷ 128 = 161) → pair (128, 161)
  17. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 23, 28, 32, 46, 56, 64, 92, 112, 128, 161, 184, 224, 322, 368, 448, 644, 736, 896, 1288, 1472, 2576, 2944, 5152, 10304, 20608} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 23 + 28 + 32 + 46 + 56 + 64 + 92 + 112 + 128 + 161 + 184 + 224 + 322 + 368 + 448 + 644 + 736 + 896 + 1288 + 1472 + 2576 + 2944 + 5152 + 10304 + 20608 = 48960.

Nearby Examples

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

Related Operations for 20608

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