Divisors of 31152: All 40 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 31152

The number 31152 has 40 divisors:

1,  2,  3,  4,  6,  8,  11,  12,  16,  22,  24,  33,  44,  48,  59,  66,  88,  118,  132,  176,  177,  236,  264,  354,  472,  528,  649,  708,  944,  1298,  1416,  1947,  2596,  2832,  3894,  5192,  7788,  10384,  15576,  31152

Divisor Pairs of 31152

Each pair multiplies to 31152:

Number of Divisors

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

Sum of Divisors

σ(31152) = 1 + 2 + 3 + 4 + 6 + 8 + 11 + 12 + 16 + 22 + 24 + 33 + 44 + 48 + 59 + 66 + 88 + 118 + 132 + 176 + 177 + 236 + 264 + 354 + 472 + 528 + 649 + 708 + 944 + 1298 + 1416 + 1947 + 2596 + 2832 + 3894 + 5192 + 7788 + 10384 + 15576 + 31152 = 89280

Prime Factorization of 31152

See the full prime factorization calculator →

Properties of 31152

• 31152 is composite.
• 31152 is not a perfect square.
• Number of divisors: 40.
• Sum of divisors: 89280.

Common Divisors with Another Number?

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

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

1. 1 divides 31152 (31152 ÷ 1 = 31152) → pair (1, 31152)
2. 2 divides 31152 (31152 ÷ 2 = 15576) → pair (2, 15576)
3. 3 divides 31152 (31152 ÷ 3 = 10384) → pair (3, 10384)
4. 4 divides 31152 (31152 ÷ 4 = 7788) → pair (4, 7788)
5. 6 divides 31152 (31152 ÷ 6 = 5192) → pair (6, 5192)
6. 8 divides 31152 (31152 ÷ 8 = 3894) → pair (8, 3894)
7. 11 divides 31152 (31152 ÷ 11 = 2832) → pair (11, 2832)
8. 12 divides 31152 (31152 ÷ 12 = 2596) → pair (12, 2596)
9. 16 divides 31152 (31152 ÷ 16 = 1947) → pair (16, 1947)
10. 22 divides 31152 (31152 ÷ 22 = 1416) → pair (22, 1416)
11. 24 divides 31152 (31152 ÷ 24 = 1298) → pair (24, 1298)
12. 33 divides 31152 (31152 ÷ 33 = 944) → pair (33, 944)
13. 44 divides 31152 (31152 ÷ 44 = 708) → pair (44, 708)
14. 48 divides 31152 (31152 ÷ 48 = 649) → pair (48, 649)
15. 59 divides 31152 (31152 ÷ 59 = 528) → pair (59, 528)
16. 66 divides 31152 (31152 ÷ 66 = 472) → pair (66, 472)
17. 88 divides 31152 (31152 ÷ 88 = 354) → pair (88, 354)
18. 118 divides 31152 (31152 ÷ 118 = 264) → pair (118, 264)
19. 132 divides 31152 (31152 ÷ 132 = 236) → pair (132, 236)
20. 176 divides 31152 (31152 ÷ 176 = 177) → pair (176, 177)
21. Collect all unique values: {1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 33, 44, 48, 59, 66, 88, 118, 132, 176, 177, 236, 264, 354, 472, 528, 649, 708, 944, 1298, 1416, 1947, 2596, 2832, 3894, 5192, 7788, 10384, 15576, 31152} — total 40 divisors.
22. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 11 + 12 + 16 + 22 + 24 + 33 + 44 + 48 + 59 + 66 + 88 + 118 + 132 + 176 + 177 + 236 + 264 + 354 + 472 + 528 + 649 + 708 + 944 + 1298 + 1416 + 1947 + 2596 + 2832 + 3894 + 5192 + 7788 + 10384 + 15576 + 31152 = 89280.

Nearby Examples

Related Operations for 31152

• Multiples of a Number — "outward" complement of divisors
• 31152 Prime Factorization — decompose into prime building blocks
• Find GCF of 31152 and another number
• Find LCM of 31152 and another number
• Is 31152 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: