Divisors of 69552: All 80 Factors

Divisors (Factors) Calculator

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 69552

The number 69552 has 80 divisors:

1,  2,  3,  4,  6,  7,  8,  9,  12,  14,  16,  18,  21,  23,  24,  27,  28,  36,  42,  46,  48,  54,  56,  63,  69,  72,  84,  92,  108,  112,  126,  138,  144,  161,  168,  184,  189,  207,  216,  252,  276,  322,  336,  368,  378,  414,  432,  483,  504,  552,  621,  644,  756,  828,  966,  1008,  1104,  1242,  1288,  1449,  1512,  1656,  1932,  2484,  2576,  2898,  3024,  3312,  3864,  4347,  4968,  5796,  7728,  8694,  9936,  11592,  17388,  23184,  34776,  69552

Divisor Pairs of 69552

Each pair multiplies to 69552:

Number of Divisors

The number 69552 has 80 divisors, written as τ(69552) = 80 in number theory.

Sum of Divisors

σ(69552) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 14 + 16 + 18 + 21 + 23 + 24 + 27 + 28 + 36 + 42 + 46 + 48 + 54 + 56 + 63 + 69 + 72 + 84 + 92 + 108 + 112 + 126 + 138 + 144 + 161 + 168 + 184 + 189 + 207 + 216 + 252 + 276 + 322 + 336 + 368 + 378 + 414 + 432 + 483 + 504 + 552 + 621 + 644 + 756 + 828 + 966 + 1008 + 1104 + 1242 + 1288 + 1449 + 1512 + 1656 + 1932 + 2484 + 2576 + 2898 + 3024 + 3312 + 3864 + 4347 + 4968 + 5796 + 7728 + 8694 + 9936 + 11592 + 17388 + 23184 + 34776 + 69552 = 238080

Prime Factorization of 69552

See the full prime factorization calculator →

Properties of 69552

• 69552 is composite.
• 69552 is not a perfect square.
• Number of divisors: 80.
• Sum of divisors: 238080.

Common Divisors with Another Number?

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

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

1. 1 divides 69552 (69552 ÷ 1 = 69552) → pair (1, 69552)
2. 2 divides 69552 (69552 ÷ 2 = 34776) → pair (2, 34776)
3. 3 divides 69552 (69552 ÷ 3 = 23184) → pair (3, 23184)
4. 4 divides 69552 (69552 ÷ 4 = 17388) → pair (4, 17388)
5. 6 divides 69552 (69552 ÷ 6 = 11592) → pair (6, 11592)
6. 7 divides 69552 (69552 ÷ 7 = 9936) → pair (7, 9936)
7. 8 divides 69552 (69552 ÷ 8 = 8694) → pair (8, 8694)
8. 9 divides 69552 (69552 ÷ 9 = 7728) → pair (9, 7728)
9. 12 divides 69552 (69552 ÷ 12 = 5796) → pair (12, 5796)
10. 14 divides 69552 (69552 ÷ 14 = 4968) → pair (14, 4968)
11. 16 divides 69552 (69552 ÷ 16 = 4347) → pair (16, 4347)
12. 18 divides 69552 (69552 ÷ 18 = 3864) → pair (18, 3864)
13. 21 divides 69552 (69552 ÷ 21 = 3312) → pair (21, 3312)
14. 23 divides 69552 (69552 ÷ 23 = 3024) → pair (23, 3024)
15. 24 divides 69552 (69552 ÷ 24 = 2898) → pair (24, 2898)
16. 27 divides 69552 (69552 ÷ 27 = 2576) → pair (27, 2576)
17. 28 divides 69552 (69552 ÷ 28 = 2484) → pair (28, 2484)
18. 36 divides 69552 (69552 ÷ 36 = 1932) → pair (36, 1932)
19. 42 divides 69552 (69552 ÷ 42 = 1656) → pair (42, 1656)
20. 46 divides 69552 (69552 ÷ 46 = 1512) → pair (46, 1512)
21. 48 divides 69552 (69552 ÷ 48 = 1449) → pair (48, 1449)
22. 54 divides 69552 (69552 ÷ 54 = 1288) → pair (54, 1288)
23. 56 divides 69552 (69552 ÷ 56 = 1242) → pair (56, 1242)
24. 63 divides 69552 (69552 ÷ 63 = 1104) → pair (63, 1104)
25. 69 divides 69552 (69552 ÷ 69 = 1008) → pair (69, 1008)
26. 72 divides 69552 (69552 ÷ 72 = 966) → pair (72, 966)
27. 84 divides 69552 (69552 ÷ 84 = 828) → pair (84, 828)
28. 92 divides 69552 (69552 ÷ 92 = 756) → pair (92, 756)
29. 108 divides 69552 (69552 ÷ 108 = 644) → pair (108, 644)
30. 112 divides 69552 (69552 ÷ 112 = 621) → pair (112, 621)
31. 126 divides 69552 (69552 ÷ 126 = 552) → pair (126, 552)
32. 138 divides 69552 (69552 ÷ 138 = 504) → pair (138, 504)
33. 144 divides 69552 (69552 ÷ 144 = 483) → pair (144, 483)
34. 161 divides 69552 (69552 ÷ 161 = 432) → pair (161, 432)
35. 168 divides 69552 (69552 ÷ 168 = 414) → pair (168, 414)
36. 184 divides 69552 (69552 ÷ 184 = 378) → pair (184, 378)
37. 189 divides 69552 (69552 ÷ 189 = 368) → pair (189, 368)
38. 207 divides 69552 (69552 ÷ 207 = 336) → pair (207, 336)
39. 216 divides 69552 (69552 ÷ 216 = 322) → pair (216, 322)
40. 252 divides 69552 (69552 ÷ 252 = 276) → pair (252, 276)
41. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 23, 24, 27, 28, 36, 42, 46, 48, 54, 56, 63, 69, 72, 84, 92, 108, 112, 126, 138, 144, 161, 168, 184, 189, 207, 216, 252, 276, 322, 336, 368, 378, 414, 432, 483, 504, 552, 621, 644, 756, 828, 966, 1008, 1104, 1242, 1288, 1449, 1512, 1656, 1932, 2484, 2576, 2898, 3024, 3312, 3864, 4347, 4968, 5796, 7728, 8694, 9936, 11592, 17388, 23184, 34776, 69552} — total 80 divisors.
42. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 14 + 16 + 18 + 21 + 23 + 24 + 27 + 28 + 36 + 42 + 46 + 48 + 54 + 56 + 63 + 69 + 72 + 84 + 92 + 108 + 112 + 126 + 138 + 144 + 161 + 168 + 184 + 189 + 207 + 216 + 252 + 276 + 322 + 336 + 368 + 378 + 414 + 432 + 483 + 504 + 552 + 621 + 644 + 756 + 828 + 966 + 1008 + 1104 + 1242 + 1288 + 1449 + 1512 + 1656 + 1932 + 2484 + 2576 + 2898 + 3024 + 3312 + 3864 + 4347 + 4968 + 5796 + 7728 + 8694 + 9936 + 11592 + 17388 + 23184 + 34776 + 69552 = 238080.

Nearby Examples

Related Operations for 69552

• Multiples of a Number — "outward" complement of divisors
• 69552 Prime Factorization — decompose into prime building blocks
• Find GCF of 69552 and another number
• Find LCM of 69552 and another number
• Is 69552 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: