Divisors of 52136: All 32 Factors
Quick Answer
52136 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 19, 28, 38, 49, 56, 76, 98, 133, 152, 196, 266, 343, 392, 532, 686, 931, 1064, 1372, 1862, 2744, 3724, 6517, 7448, 13034, 26068, 52136.
Sum: 120000.
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 52136
The number 52136 has 32 divisors:
1, 2, 4, 7, 8, 14, 19, 28, 38, 49, 56, 76, 98, 133, 152, 196, 266, 343, 392, 532, 686, 931, 1064, 1372, 1862, 2744, 3724, 6517, 7448, 13034, 26068, 52136
Divisor Pairs of 52136
Each pair multiplies to 52136:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 52136 | = | 52136 |
| 2 | × | 26068 | = | 52136 |
| 4 | × | 13034 | = | 52136 |
| 7 | × | 7448 | = | 52136 |
| 8 | × | 6517 | = | 52136 |
| 14 | × | 3724 | = | 52136 |
| 19 | × | 2744 | = | 52136 |
| 28 | × | 1862 | = | 52136 |
| 38 | × | 1372 | = | 52136 |
| 49 | × | 1064 | = | 52136 |
| 56 | × | 931 | = | 52136 |
| 76 | × | 686 | = | 52136 |
| 98 | × | 532 | = | 52136 |
| 133 | × | 392 | = | 52136 |
| 152 | × | 343 | = | 52136 |
| 196 | × | 266 | = | 52136 |
Number of Divisors
The number 52136 has 32 divisors, written as τ(52136) = 32 in number theory.
Sum of Divisors
σ(52136) = 1 + 2 + 4 + 7 + 8 + 14 + 19 + 28 + 38 + 49 + 56 + 76 + 98 + 133 + 152 + 196 + 266 + 343 + 392 + 532 + 686 + 931 + 1064 + 1372 + 1862 + 2744 + 3724 + 6517 + 7448 + 13034 + 26068 + 52136 = 120000
Prime Factorization of 52136
Properties of 52136
- 52136 is composite.
- 52136 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 120000.
Common Divisors with Another Number?
Looking for the divisors that 52136 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 52136
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √52136 ≈ 228.33. If i divides 52136, then both i and 52136/i are divisors.
- 1 divides 52136 (52136 ÷ 1 = 52136) → pair (1, 52136)
- 2 divides 52136 (52136 ÷ 2 = 26068) → pair (2, 26068)
- 4 divides 52136 (52136 ÷ 4 = 13034) → pair (4, 13034)
- 7 divides 52136 (52136 ÷ 7 = 7448) → pair (7, 7448)
- 8 divides 52136 (52136 ÷ 8 = 6517) → pair (8, 6517)
- 14 divides 52136 (52136 ÷ 14 = 3724) → pair (14, 3724)
- 19 divides 52136 (52136 ÷ 19 = 2744) → pair (19, 2744)
- 28 divides 52136 (52136 ÷ 28 = 1862) → pair (28, 1862)
- 38 divides 52136 (52136 ÷ 38 = 1372) → pair (38, 1372)
- 49 divides 52136 (52136 ÷ 49 = 1064) → pair (49, 1064)
- 56 divides 52136 (52136 ÷ 56 = 931) → pair (56, 931)
- 76 divides 52136 (52136 ÷ 76 = 686) → pair (76, 686)
- 98 divides 52136 (52136 ÷ 98 = 532) → pair (98, 532)
- 133 divides 52136 (52136 ÷ 133 = 392) → pair (133, 392)
- 152 divides 52136 (52136 ÷ 152 = 343) → pair (152, 343)
- 196 divides 52136 (52136 ÷ 196 = 266) → pair (196, 266)
- Collect all unique values: {1, 2, 4, 7, 8, 14, 19, 28, 38, 49, 56, 76, 98, 133, 152, 196, 266, 343, 392, 532, 686, 931, 1064, 1372, 1862, 2744, 3724, 6517, 7448, 13034, 26068, 52136} — total 32 divisors.
- Sum: 1 + 2 + 4 + 7 + 8 + 14 + 19 + 28 + 38 + 49 + 56 + 76 + 98 + 133 + 152 + 196 + 266 + 343 + 392 + 532 + 686 + 931 + 1064 + 1372 + 1862 + 2744 + 3724 + 6517 + 7448 + 13034 + 26068 + 52136 = 120000.
Nearby Examples
Related Operations for 52136
- Multiples of a Number — "outward" complement of divisors
- 52136 Prime Factorization — decompose into prime building blocks
- Find GCF of 52136 and another number
- Find LCM of 52136 and another number
- Is 52136 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