Divisors of 2052: All 24 Factors
Quick Answer
2052 has 24 divisors (factors): 1, 2, 3, 4, 6, 9, 12, 18, 19, 27, 36, 38, 54, 57, 76, 108, 114, 171, 228, 342, 513, 684, 1026, 2052.
Sum: 5600.
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 2052
The number 2052 has 24 divisors:
1, 2, 3, 4, 6, 9, 12, 18, 19, 27, 36, 38, 54, 57, 76, 108, 114, 171, 228, 342, 513, 684, 1026, 2052
Divisor Pairs of 2052
Each pair multiplies to 2052:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 2052 | = | 2052 |
| 2 | × | 1026 | = | 2052 |
| 3 | × | 684 | = | 2052 |
| 4 | × | 513 | = | 2052 |
| 6 | × | 342 | = | 2052 |
| 9 | × | 228 | = | 2052 |
| 12 | × | 171 | = | 2052 |
| 18 | × | 114 | = | 2052 |
| 19 | × | 108 | = | 2052 |
| 27 | × | 76 | = | 2052 |
| 36 | × | 57 | = | 2052 |
| 38 | × | 54 | = | 2052 |
Number of Divisors
The number 2052 has 24 divisors, written as τ(2052) = 24 in number theory.
Sum of Divisors
σ(2052) = 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 19 + 27 + 36 + 38 + 54 + 57 + 76 + 108 + 114 + 171 + 228 + 342 + 513 + 684 + 1026 + 2052 = 5600
Prime Factorization of 2052
Properties of 2052
- 2052 is composite.
- 2052 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 5600.
Common Divisors with Another Number?
Looking for the divisors that 2052 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 2052
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √2052 ≈ 45.30. If i divides 2052, then both i and 2052/i are divisors.
- 1 divides 2052 (2052 ÷ 1 = 2052) → pair (1, 2052)
- 2 divides 2052 (2052 ÷ 2 = 1026) → pair (2, 1026)
- 3 divides 2052 (2052 ÷ 3 = 684) → pair (3, 684)
- 4 divides 2052 (2052 ÷ 4 = 513) → pair (4, 513)
- 6 divides 2052 (2052 ÷ 6 = 342) → pair (6, 342)
- 9 divides 2052 (2052 ÷ 9 = 228) → pair (9, 228)
- 12 divides 2052 (2052 ÷ 12 = 171) → pair (12, 171)
- 18 divides 2052 (2052 ÷ 18 = 114) → pair (18, 114)
- 19 divides 2052 (2052 ÷ 19 = 108) → pair (19, 108)
- 27 divides 2052 (2052 ÷ 27 = 76) → pair (27, 76)
- 36 divides 2052 (2052 ÷ 36 = 57) → pair (36, 57)
- 38 divides 2052 (2052 ÷ 38 = 54) → pair (38, 54)
- Collect all unique values: {1, 2, 3, 4, 6, 9, 12, 18, 19, 27, 36, 38, 54, 57, 76, 108, 114, 171, 228, 342, 513, 684, 1026, 2052} — total 24 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 19 + 27 + 36 + 38 + 54 + 57 + 76 + 108 + 114 + 171 + 228 + 342 + 513 + 684 + 1026 + 2052 = 5600.
Nearby Examples
Related Operations for 2052
- Multiples of 2052 — "outward" complement; M is a multiple of 2052 ⇔ 2052 is a divisor of M
- 2052 Prime Factorization — decompose into prime building blocks
- Find GCF of 2052 and another number
- Find LCM of 2052 and another number
- Is 2052 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