Divisors of 4752: All 40 Factors

Quick Answer

4752 has 40 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 27, 33, 36, 44, 48, 54, 66, 72, 88, 99, 108, 132, 144, 176, 198, 216, 264, 297, 396, 432, 528, 594, 792, 1188, 1584, 2376, 4752.

Sum: 14880.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 27, 33, 36, 44, 48, 54, 66, 72, 88, 99, 108, 132, 144, 176, 198, 216, 264, 297, 396, 432, 528, 594, 792, 1188, 1584, 2376, 4752

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 4752

The number 4752 has 40 divisors:

1,  2,  3,  4,  6,  8,  9,  11,  12,  16,  18,  22,  24,  27,  33,  36,  44,  48,  54,  66,  72,  88,  99,  108,  132,  144,  176,  198,  216,  264,  297,  396,  432,  528,  594,  792,  1188,  1584,  2376,  4752

Divisor Pairs of 4752

Each pair multiplies to 4752:

Factor 1×Factor 2=Product
1×4752=4752
2×2376=4752
3×1584=4752
4×1188=4752
6×792=4752
8×594=4752
9×528=4752
11×432=4752
12×396=4752
16×297=4752
18×264=4752
22×216=4752
24×198=4752
27×176=4752
33×144=4752
36×132=4752
44×108=4752
48×99=4752
54×88=4752
66×72=4752

Number of Divisors

The number 4752 has 40 divisors, written as τ(4752) = 40 in number theory.

Sum of Divisors

σ(4752) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 11 + 12 + 16 + 18 + 22 + 24 + 27 + 33 + 36 + 44 + 48 + 54 + 66 + 72 + 88 + 99 + 108 + 132 + 144 + 176 + 198 + 216 + 264 + 297 + 396 + 432 + 528 + 594 + 792 + 1188 + 1584 + 2376 + 4752 = 14880

Properties of 4752

  • 4752 is composite.
  • 4752 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 14880.

Common Divisors with Another Number?

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

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

  1. 1 divides 4752 (4752 ÷ 1 = 4752) → pair (1, 4752)
  2. 2 divides 4752 (4752 ÷ 2 = 2376) → pair (2, 2376)
  3. 3 divides 4752 (4752 ÷ 3 = 1584) → pair (3, 1584)
  4. 4 divides 4752 (4752 ÷ 4 = 1188) → pair (4, 1188)
  5. 6 divides 4752 (4752 ÷ 6 = 792) → pair (6, 792)
  6. 8 divides 4752 (4752 ÷ 8 = 594) → pair (8, 594)
  7. 9 divides 4752 (4752 ÷ 9 = 528) → pair (9, 528)
  8. 11 divides 4752 (4752 ÷ 11 = 432) → pair (11, 432)
  9. 12 divides 4752 (4752 ÷ 12 = 396) → pair (12, 396)
  10. 16 divides 4752 (4752 ÷ 16 = 297) → pair (16, 297)
  11. 18 divides 4752 (4752 ÷ 18 = 264) → pair (18, 264)
  12. 22 divides 4752 (4752 ÷ 22 = 216) → pair (22, 216)
  13. 24 divides 4752 (4752 ÷ 24 = 198) → pair (24, 198)
  14. 27 divides 4752 (4752 ÷ 27 = 176) → pair (27, 176)
  15. 33 divides 4752 (4752 ÷ 33 = 144) → pair (33, 144)
  16. 36 divides 4752 (4752 ÷ 36 = 132) → pair (36, 132)
  17. 44 divides 4752 (4752 ÷ 44 = 108) → pair (44, 108)
  18. 48 divides 4752 (4752 ÷ 48 = 99) → pair (48, 99)
  19. 54 divides 4752 (4752 ÷ 54 = 88) → pair (54, 88)
  20. 66 divides 4752 (4752 ÷ 66 = 72) → pair (66, 72)
  21. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 27, 33, 36, 44, 48, 54, 66, 72, 88, 99, 108, 132, 144, 176, 198, 216, 264, 297, 396, 432, 528, 594, 792, 1188, 1584, 2376, 4752} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 11 + 12 + 16 + 18 + 22 + 24 + 27 + 33 + 36 + 44 + 48 + 54 + 66 + 72 + 88 + 99 + 108 + 132 + 144 + 176 + 198 + 216 + 264 + 297 + 396 + 432 + 528 + 594 + 792 + 1188 + 1584 + 2376 + 4752 = 14880.

Nearby Examples

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

Related Operations for 4752

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