Divisors of 1764: All 27 Factors
Quick Answer
1764 has 27 divisors (factors): 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 49, 63, 84, 98, 126, 147, 196, 252, 294, 441, 588, 882, 1764.
Sum: 5187. 1764 is a perfect square (√1764 = 42).
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 1764
The number 1764 has 27 divisors:
1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 49, 63, 84, 98, 126, 147, 196, 252, 294, 441, 588, 882, 1764
Divisor Pairs of 1764
Each pair multiplies to 1764:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 1764 | = | 1764 |
| 2 | × | 882 | = | 1764 |
| 3 | × | 588 | = | 1764 |
| 4 | × | 441 | = | 1764 |
| 6 | × | 294 | = | 1764 |
| 7 | × | 252 | = | 1764 |
| 9 | × | 196 | = | 1764 |
| 12 | × | 147 | = | 1764 |
| 14 | × | 126 | = | 1764 |
| 18 | × | 98 | = | 1764 |
| 21 | × | 84 | = | 1764 |
| 28 | × | 63 | = | 1764 |
| 36 | × | 49 | = | 1764 |
| 42 | × | 42 | = | 1764 |
Note: the last pair has identical factors (42 × 42) because 1764 is a perfect square.
Number of Divisors
The number 1764 has 27 divisors, written as τ(1764) = 27 in number theory.
⚡ Notice: 1764 has an odd number of divisors — this means 1764 is a perfect square (√1764 = 42).
Sum of Divisors
σ(1764) = 1 + 2 + 3 + 4 + 6 + 7 + 9 + 12 + 14 + 18 + 21 + 28 + 36 + 42 + 49 + 63 + 84 + 98 + 126 + 147 + 196 + 252 + 294 + 441 + 588 + 882 + 1764 = 5187
Prime Factorization of 1764
Properties of 1764
- 1764 is composite.
- 1764 is a perfect square (√1764 = 42).
- Number of divisors: 27.
- Sum of divisors: 5187.
Common Divisors with Another Number?
Looking for the divisors that 1764 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 1764
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √1764 ≈ 42.00. If i divides 1764, then both i and 1764/i are divisors.
- 1 divides 1764 (1764 ÷ 1 = 1764) → pair (1, 1764)
- 2 divides 1764 (1764 ÷ 2 = 882) → pair (2, 882)
- 3 divides 1764 (1764 ÷ 3 = 588) → pair (3, 588)
- 4 divides 1764 (1764 ÷ 4 = 441) → pair (4, 441)
- 6 divides 1764 (1764 ÷ 6 = 294) → pair (6, 294)
- 7 divides 1764 (1764 ÷ 7 = 252) → pair (7, 252)
- 9 divides 1764 (1764 ÷ 9 = 196) → pair (9, 196)
- 12 divides 1764 (1764 ÷ 12 = 147) → pair (12, 147)
- 14 divides 1764 (1764 ÷ 14 = 126) → pair (14, 126)
- 18 divides 1764 (1764 ÷ 18 = 98) → pair (18, 98)
- 21 divides 1764 (1764 ÷ 21 = 84) → pair (21, 84)
- 28 divides 1764 (1764 ÷ 28 = 63) → pair (28, 63)
- 36 divides 1764 (1764 ÷ 36 = 49) → pair (36, 49)
- 42 divides 1764 (1764 ÷ 42 = 42) → pair (42, 42)
- Collect all unique values: {1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 49, 63, 84, 98, 126, 147, 196, 252, 294, 441, 588, 882, 1764} — total 27 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 7 + 9 + 12 + 14 + 18 + 21 + 28 + 36 + 42 + 49 + 63 + 84 + 98 + 126 + 147 + 196 + 252 + 294 + 441 + 588 + 882 + 1764 = 5187.
Nearby Examples
Related Operations for 1764
- Multiples of 1764 — "outward" complement; M is a multiple of 1764 ⇔ 1764 is a divisor of M
- 1764 Prime Factorization — decompose into prime building blocks
- Find GCF of 1764 and another number
- Find LCM of 1764 and another number
- Is 1764 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