Divisors of 25137: All 24 Factors
Quick Answer
25137 has 24 divisors (factors): 1, 3, 7, 9, 19, 21, 27, 49, 57, 63, 133, 147, 171, 189, 399, 441, 513, 931, 1197, 1323, 2793, 3591, 8379, 25137.
Sum: 45600.
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 25137
The number 25137 has 24 divisors:
1, 3, 7, 9, 19, 21, 27, 49, 57, 63, 133, 147, 171, 189, 399, 441, 513, 931, 1197, 1323, 2793, 3591, 8379, 25137
Divisor Pairs of 25137
Each pair multiplies to 25137:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 25137 | = | 25137 |
| 3 | × | 8379 | = | 25137 |
| 7 | × | 3591 | = | 25137 |
| 9 | × | 2793 | = | 25137 |
| 19 | × | 1323 | = | 25137 |
| 21 | × | 1197 | = | 25137 |
| 27 | × | 931 | = | 25137 |
| 49 | × | 513 | = | 25137 |
| 57 | × | 441 | = | 25137 |
| 63 | × | 399 | = | 25137 |
| 133 | × | 189 | = | 25137 |
| 147 | × | 171 | = | 25137 |
Number of Divisors
The number 25137 has 24 divisors, written as τ(25137) = 24 in number theory.
Sum of Divisors
σ(25137) = 1 + 3 + 7 + 9 + 19 + 21 + 27 + 49 + 57 + 63 + 133 + 147 + 171 + 189 + 399 + 441 + 513 + 931 + 1197 + 1323 + 2793 + 3591 + 8379 + 25137 = 45600
Prime Factorization of 25137
Properties of 25137
- 25137 is composite.
- 25137 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 45600.
Common Divisors with Another Number?
Looking for the divisors that 25137 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 25137
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √25137 ≈ 158.55. If i divides 25137, then both i and 25137/i are divisors.
- 1 divides 25137 (25137 ÷ 1 = 25137) → pair (1, 25137)
- 3 divides 25137 (25137 ÷ 3 = 8379) → pair (3, 8379)
- 7 divides 25137 (25137 ÷ 7 = 3591) → pair (7, 3591)
- 9 divides 25137 (25137 ÷ 9 = 2793) → pair (9, 2793)
- 19 divides 25137 (25137 ÷ 19 = 1323) → pair (19, 1323)
- 21 divides 25137 (25137 ÷ 21 = 1197) → pair (21, 1197)
- 27 divides 25137 (25137 ÷ 27 = 931) → pair (27, 931)
- 49 divides 25137 (25137 ÷ 49 = 513) → pair (49, 513)
- 57 divides 25137 (25137 ÷ 57 = 441) → pair (57, 441)
- 63 divides 25137 (25137 ÷ 63 = 399) → pair (63, 399)
- 133 divides 25137 (25137 ÷ 133 = 189) → pair (133, 189)
- 147 divides 25137 (25137 ÷ 147 = 171) → pair (147, 171)
- Collect all unique values: {1, 3, 7, 9, 19, 21, 27, 49, 57, 63, 133, 147, 171, 189, 399, 441, 513, 931, 1197, 1323, 2793, 3591, 8379, 25137} — total 24 divisors.
- Sum: 1 + 3 + 7 + 9 + 19 + 21 + 27 + 49 + 57 + 63 + 133 + 147 + 171 + 189 + 399 + 441 + 513 + 931 + 1197 + 1323 + 2793 + 3591 + 8379 + 25137 = 45600.
Nearby Examples
Related Operations for 25137
- Multiples of a Number — "outward" complement of divisors
- 25137 Prime Factorization — decompose into prime building blocks
- Find GCF of 25137 and another number
- Find LCM of 25137 and another number
- Is 25137 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check