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