Divisors of 20096: All 16 Factors

Quick Answer

20096 has 16 divisors (factors): 1, 2, 4, 8, 16, 32, 64, 128, 157, 314, 628, 1256, 2512, 5024, 10048, 20096.

Sum: 40290.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
16 divisors
1, 2, 4, 8, 16, 32, 64, 128, 157, 314, 628, 1256, 2512, 5024, 10048, 20096

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 20096

The number 20096 has 16 divisors:

1,  2,  4,  8,  16,  32,  64,  128,  157,  314,  628,  1256,  2512,  5024,  10048,  20096

Divisor Pairs of 20096

Each pair multiplies to 20096:

Factor 1×Factor 2=Product
1×20096=20096
2×10048=20096
4×5024=20096
8×2512=20096
16×1256=20096
32×628=20096
64×314=20096
128×157=20096

Number of Divisors

The number 20096 has 16 divisors, written as τ(20096) = 16 in number theory.

Sum of Divisors

σ(20096) = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 157 + 314 + 628 + 1256 + 2512 + 5024 + 10048 + 20096 = 40290

Properties of 20096

  • 20096 is composite.
  • 20096 is not a perfect square.
  • Number of divisors: 16.
  • Sum of divisors: 40290.

Common Divisors with Another Number?

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

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

  1. 1 divides 20096 (20096 ÷ 1 = 20096) → pair (1, 20096)
  2. 2 divides 20096 (20096 ÷ 2 = 10048) → pair (2, 10048)
  3. 4 divides 20096 (20096 ÷ 4 = 5024) → pair (4, 5024)
  4. 8 divides 20096 (20096 ÷ 8 = 2512) → pair (8, 2512)
  5. 16 divides 20096 (20096 ÷ 16 = 1256) → pair (16, 1256)
  6. 32 divides 20096 (20096 ÷ 32 = 628) → pair (32, 628)
  7. 64 divides 20096 (20096 ÷ 64 = 314) → pair (64, 314)
  8. 128 divides 20096 (20096 ÷ 128 = 157) → pair (128, 157)
  9. Collect all unique values: {1, 2, 4, 8, 16, 32, 64, 128, 157, 314, 628, 1256, 2512, 5024, 10048, 20096} — total 16 divisors.
  10. Sum: 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 157 + 314 + 628 + 1256 + 2512 + 5024 + 10048 + 20096 = 40290.

Nearby Examples

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

Related Operations for 20096

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