Divisors of 4704: All 36 Factors

Quick Answer

4704 has 36 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 42, 48, 49, 56, 84, 96, 98, 112, 147, 168, 196, 224, 294, 336, 392, 588, 672, 784, 1176, 1568, 2352, 4704.

Sum: 14364.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 42, 48, 49, 56, 84, 96, 98, 112, 147, 168, 196, 224, 294, 336, 392, 588, 672, 784, 1176, 1568, 2352, 4704

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 4704

The number 4704 has 36 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  16,  21,  24,  28,  32,  42,  48,  49,  56,  84,  96,  98,  112,  147,  168,  196,  224,  294,  336,  392,  588,  672,  784,  1176,  1568,  2352,  4704

Divisor Pairs of 4704

Each pair multiplies to 4704:

Factor 1×Factor 2=Product
1×4704=4704
2×2352=4704
3×1568=4704
4×1176=4704
6×784=4704
7×672=4704
8×588=4704
12×392=4704
14×336=4704
16×294=4704
21×224=4704
24×196=4704
28×168=4704
32×147=4704
42×112=4704
48×98=4704
49×96=4704
56×84=4704

Number of Divisors

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

Sum of Divisors

σ(4704) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 16 + 21 + 24 + 28 + 32 + 42 + 48 + 49 + 56 + 84 + 96 + 98 + 112 + 147 + 168 + 196 + 224 + 294 + 336 + 392 + 588 + 672 + 784 + 1176 + 1568 + 2352 + 4704 = 14364

Properties of 4704

  • 4704 is composite.
  • 4704 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 14364.

Common Divisors with Another Number?

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

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

  1. 1 divides 4704 (4704 ÷ 1 = 4704) → pair (1, 4704)
  2. 2 divides 4704 (4704 ÷ 2 = 2352) → pair (2, 2352)
  3. 3 divides 4704 (4704 ÷ 3 = 1568) → pair (3, 1568)
  4. 4 divides 4704 (4704 ÷ 4 = 1176) → pair (4, 1176)
  5. 6 divides 4704 (4704 ÷ 6 = 784) → pair (6, 784)
  6. 7 divides 4704 (4704 ÷ 7 = 672) → pair (7, 672)
  7. 8 divides 4704 (4704 ÷ 8 = 588) → pair (8, 588)
  8. 12 divides 4704 (4704 ÷ 12 = 392) → pair (12, 392)
  9. 14 divides 4704 (4704 ÷ 14 = 336) → pair (14, 336)
  10. 16 divides 4704 (4704 ÷ 16 = 294) → pair (16, 294)
  11. 21 divides 4704 (4704 ÷ 21 = 224) → pair (21, 224)
  12. 24 divides 4704 (4704 ÷ 24 = 196) → pair (24, 196)
  13. 28 divides 4704 (4704 ÷ 28 = 168) → pair (28, 168)
  14. 32 divides 4704 (4704 ÷ 32 = 147) → pair (32, 147)
  15. 42 divides 4704 (4704 ÷ 42 = 112) → pair (42, 112)
  16. 48 divides 4704 (4704 ÷ 48 = 98) → pair (48, 98)
  17. 49 divides 4704 (4704 ÷ 49 = 96) → pair (49, 96)
  18. 56 divides 4704 (4704 ÷ 56 = 84) → pair (56, 84)
  19. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 42, 48, 49, 56, 84, 96, 98, 112, 147, 168, 196, 224, 294, 336, 392, 588, 672, 784, 1176, 1568, 2352, 4704} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 16 + 21 + 24 + 28 + 32 + 42 + 48 + 49 + 56 + 84 + 96 + 98 + 112 + 147 + 168 + 196 + 224 + 294 + 336 + 392 + 588 + 672 + 784 + 1176 + 1568 + 2352 + 4704 = 14364.

Nearby Examples

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

Related Operations for 4704

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