Divisors of 1440: All 36 Factors
Quick Answer
1440 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 30, 32, 36, 40, 45, 48, 60, 72, 80, 90, 96, 120, 144, 160, 180, 240, 288, 360, 480, 720, 1440.
Sum: 4914.
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 1440
The number 1440 has 36 divisors:
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 30, 32, 36, 40, 45, 48, 60, 72, 80, 90, 96, 120, 144, 160, 180, 240, 288, 360, 480, 720, 1440
Divisor Pairs of 1440
Each pair multiplies to 1440:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 1440 | = | 1440 |
| 2 | × | 720 | = | 1440 |
| 3 | × | 480 | = | 1440 |
| 4 | × | 360 | = | 1440 |
| 5 | × | 288 | = | 1440 |
| 6 | × | 240 | = | 1440 |
| 8 | × | 180 | = | 1440 |
| 9 | × | 160 | = | 1440 |
| 10 | × | 144 | = | 1440 |
| 12 | × | 120 | = | 1440 |
| 15 | × | 96 | = | 1440 |
| 16 | × | 90 | = | 1440 |
| 18 | × | 80 | = | 1440 |
| 20 | × | 72 | = | 1440 |
| 24 | × | 60 | = | 1440 |
| 30 | × | 48 | = | 1440 |
| 32 | × | 45 | = | 1440 |
| 36 | × | 40 | = | 1440 |
Number of Divisors
The number 1440 has 36 divisors, written as τ(1440) = 36 in number theory.
Sum of Divisors
σ(1440) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 24 + 30 + 32 + 36 + 40 + 45 + 48 + 60 + 72 + 80 + 90 + 96 + 120 + 144 + 160 + 180 + 240 + 288 + 360 + 480 + 720 + 1440 = 4914
Prime Factorization of 1440
Properties of 1440
- 1440 is composite.
- 1440 is not a perfect square.
- Number of divisors: 36.
- Sum of divisors: 4914.
Common Divisors with Another Number?
Looking for the divisors that 1440 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 1440
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √1440 ≈ 37.95. If i divides 1440, then both i and 1440/i are divisors.
- 1 divides 1440 (1440 ÷ 1 = 1440) → pair (1, 1440)
- 2 divides 1440 (1440 ÷ 2 = 720) → pair (2, 720)
- 3 divides 1440 (1440 ÷ 3 = 480) → pair (3, 480)
- 4 divides 1440 (1440 ÷ 4 = 360) → pair (4, 360)
- 5 divides 1440 (1440 ÷ 5 = 288) → pair (5, 288)
- 6 divides 1440 (1440 ÷ 6 = 240) → pair (6, 240)
- 8 divides 1440 (1440 ÷ 8 = 180) → pair (8, 180)
- 9 divides 1440 (1440 ÷ 9 = 160) → pair (9, 160)
- 10 divides 1440 (1440 ÷ 10 = 144) → pair (10, 144)
- 12 divides 1440 (1440 ÷ 12 = 120) → pair (12, 120)
- 15 divides 1440 (1440 ÷ 15 = 96) → pair (15, 96)
- 16 divides 1440 (1440 ÷ 16 = 90) → pair (16, 90)
- 18 divides 1440 (1440 ÷ 18 = 80) → pair (18, 80)
- 20 divides 1440 (1440 ÷ 20 = 72) → pair (20, 72)
- 24 divides 1440 (1440 ÷ 24 = 60) → pair (24, 60)
- 30 divides 1440 (1440 ÷ 30 = 48) → pair (30, 48)
- 32 divides 1440 (1440 ÷ 32 = 45) → pair (32, 45)
- 36 divides 1440 (1440 ÷ 36 = 40) → pair (36, 40)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 30, 32, 36, 40, 45, 48, 60, 72, 80, 90, 96, 120, 144, 160, 180, 240, 288, 360, 480, 720, 1440} — total 36 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 24 + 30 + 32 + 36 + 40 + 45 + 48 + 60 + 72 + 80 + 90 + 96 + 120 + 144 + 160 + 180 + 240 + 288 + 360 + 480 + 720 + 1440 = 4914.
Nearby Examples
Related Operations for 1440
- Multiples of 1440 — "outward" complement; M is a multiple of 1440 ⇔ 1440 is a divisor of M
- 1440 Prime Factorization — decompose into prime building blocks
- Find GCF of 1440 and another number
- Find LCM of 1440 and another number
- Is 1440 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