Divisors of 19712: All 36 Factors

Quick Answer

19712 has 36 divisors (factors): 1, 2, 4, 7, 8, 11, 14, 16, 22, 28, 32, 44, 56, 64, 77, 88, 112, 128, 154, 176, 224, 256, 308, 352, 448, 616, 704, 896, 1232, 1408, 1792, 2464, 2816, 4928, 9856, 19712.

Sum: 49056.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 7, 8, 11, 14, 16, 22, 28, 32, 44, 56, 64, 77, 88, 112, 128, 154, 176, 224, 256, 308, 352, 448, 616, 704, 896, 1232, 1408, 1792, 2464, 2816, 4928, 9856, 19712

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 19712

The number 19712 has 36 divisors:

1,  2,  4,  7,  8,  11,  14,  16,  22,  28,  32,  44,  56,  64,  77,  88,  112,  128,  154,  176,  224,  256,  308,  352,  448,  616,  704,  896,  1232,  1408,  1792,  2464,  2816,  4928,  9856,  19712

Divisor Pairs of 19712

Each pair multiplies to 19712:

Factor 1×Factor 2=Product
1×19712=19712
2×9856=19712
4×4928=19712
7×2816=19712
8×2464=19712
11×1792=19712
14×1408=19712
16×1232=19712
22×896=19712
28×704=19712
32×616=19712
44×448=19712
56×352=19712
64×308=19712
77×256=19712
88×224=19712
112×176=19712
128×154=19712

Number of Divisors

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

Sum of Divisors

σ(19712) = 1 + 2 + 4 + 7 + 8 + 11 + 14 + 16 + 22 + 28 + 32 + 44 + 56 + 64 + 77 + 88 + 112 + 128 + 154 + 176 + 224 + 256 + 308 + 352 + 448 + 616 + 704 + 896 + 1232 + 1408 + 1792 + 2464 + 2816 + 4928 + 9856 + 19712 = 49056

Properties of 19712

  • 19712 is composite.
  • 19712 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 49056.

Common Divisors with Another Number?

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

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

  1. 1 divides 19712 (19712 ÷ 1 = 19712) → pair (1, 19712)
  2. 2 divides 19712 (19712 ÷ 2 = 9856) → pair (2, 9856)
  3. 4 divides 19712 (19712 ÷ 4 = 4928) → pair (4, 4928)
  4. 7 divides 19712 (19712 ÷ 7 = 2816) → pair (7, 2816)
  5. 8 divides 19712 (19712 ÷ 8 = 2464) → pair (8, 2464)
  6. 11 divides 19712 (19712 ÷ 11 = 1792) → pair (11, 1792)
  7. 14 divides 19712 (19712 ÷ 14 = 1408) → pair (14, 1408)
  8. 16 divides 19712 (19712 ÷ 16 = 1232) → pair (16, 1232)
  9. 22 divides 19712 (19712 ÷ 22 = 896) → pair (22, 896)
  10. 28 divides 19712 (19712 ÷ 28 = 704) → pair (28, 704)
  11. 32 divides 19712 (19712 ÷ 32 = 616) → pair (32, 616)
  12. 44 divides 19712 (19712 ÷ 44 = 448) → pair (44, 448)
  13. 56 divides 19712 (19712 ÷ 56 = 352) → pair (56, 352)
  14. 64 divides 19712 (19712 ÷ 64 = 308) → pair (64, 308)
  15. 77 divides 19712 (19712 ÷ 77 = 256) → pair (77, 256)
  16. 88 divides 19712 (19712 ÷ 88 = 224) → pair (88, 224)
  17. 112 divides 19712 (19712 ÷ 112 = 176) → pair (112, 176)
  18. 128 divides 19712 (19712 ÷ 128 = 154) → pair (128, 154)
  19. Collect all unique values: {1, 2, 4, 7, 8, 11, 14, 16, 22, 28, 32, 44, 56, 64, 77, 88, 112, 128, 154, 176, 224, 256, 308, 352, 448, 616, 704, 896, 1232, 1408, 1792, 2464, 2816, 4928, 9856, 19712} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 7 + 8 + 11 + 14 + 16 + 22 + 28 + 32 + 44 + 56 + 64 + 77 + 88 + 112 + 128 + 154 + 176 + 224 + 256 + 308 + 352 + 448 + 616 + 704 + 896 + 1232 + 1408 + 1792 + 2464 + 2816 + 4928 + 9856 + 19712 = 49056.

Nearby Examples

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

Related Operations for 19712

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