Divisors of 7260: All 36 Factors
Quick Answer
7260 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 121, 132, 165, 220, 242, 330, 363, 484, 605, 660, 726, 1210, 1452, 1815, 2420, 3630, 7260.
Sum: 22344.
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 7260
The number 7260 has 36 divisors:
1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 121, 132, 165, 220, 242, 330, 363, 484, 605, 660, 726, 1210, 1452, 1815, 2420, 3630, 7260
Divisor Pairs of 7260
Each pair multiplies to 7260:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 7260 | = | 7260 |
| 2 | × | 3630 | = | 7260 |
| 3 | × | 2420 | = | 7260 |
| 4 | × | 1815 | = | 7260 |
| 5 | × | 1452 | = | 7260 |
| 6 | × | 1210 | = | 7260 |
| 10 | × | 726 | = | 7260 |
| 11 | × | 660 | = | 7260 |
| 12 | × | 605 | = | 7260 |
| 15 | × | 484 | = | 7260 |
| 20 | × | 363 | = | 7260 |
| 22 | × | 330 | = | 7260 |
| 30 | × | 242 | = | 7260 |
| 33 | × | 220 | = | 7260 |
| 44 | × | 165 | = | 7260 |
| 55 | × | 132 | = | 7260 |
| 60 | × | 121 | = | 7260 |
| 66 | × | 110 | = | 7260 |
Number of Divisors
The number 7260 has 36 divisors, written as τ(7260) = 36 in number theory.
Sum of Divisors
σ(7260) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 11 + 12 + 15 + 20 + 22 + 30 + 33 + 44 + 55 + 60 + 66 + 110 + 121 + 132 + 165 + 220 + 242 + 330 + 363 + 484 + 605 + 660 + 726 + 1210 + 1452 + 1815 + 2420 + 3630 + 7260 = 22344
Prime Factorization of 7260
Properties of 7260
- 7260 is composite.
- 7260 is not a perfect square.
- Number of divisors: 36.
- Sum of divisors: 22344.
Common Divisors with Another Number?
Looking for the divisors that 7260 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 7260
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √7260 ≈ 85.21. If i divides 7260, then both i and 7260/i are divisors.
- 1 divides 7260 (7260 ÷ 1 = 7260) → pair (1, 7260)
- 2 divides 7260 (7260 ÷ 2 = 3630) → pair (2, 3630)
- 3 divides 7260 (7260 ÷ 3 = 2420) → pair (3, 2420)
- 4 divides 7260 (7260 ÷ 4 = 1815) → pair (4, 1815)
- 5 divides 7260 (7260 ÷ 5 = 1452) → pair (5, 1452)
- 6 divides 7260 (7260 ÷ 6 = 1210) → pair (6, 1210)
- 10 divides 7260 (7260 ÷ 10 = 726) → pair (10, 726)
- 11 divides 7260 (7260 ÷ 11 = 660) → pair (11, 660)
- 12 divides 7260 (7260 ÷ 12 = 605) → pair (12, 605)
- 15 divides 7260 (7260 ÷ 15 = 484) → pair (15, 484)
- 20 divides 7260 (7260 ÷ 20 = 363) → pair (20, 363)
- 22 divides 7260 (7260 ÷ 22 = 330) → pair (22, 330)
- 30 divides 7260 (7260 ÷ 30 = 242) → pair (30, 242)
- 33 divides 7260 (7260 ÷ 33 = 220) → pair (33, 220)
- 44 divides 7260 (7260 ÷ 44 = 165) → pair (44, 165)
- 55 divides 7260 (7260 ÷ 55 = 132) → pair (55, 132)
- 60 divides 7260 (7260 ÷ 60 = 121) → pair (60, 121)
- 66 divides 7260 (7260 ÷ 66 = 110) → pair (66, 110)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 30, 33, 44, 55, 60, 66, 110, 121, 132, 165, 220, 242, 330, 363, 484, 605, 660, 726, 1210, 1452, 1815, 2420, 3630, 7260} — total 36 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 11 + 12 + 15 + 20 + 22 + 30 + 33 + 44 + 55 + 60 + 66 + 110 + 121 + 132 + 165 + 220 + 242 + 330 + 363 + 484 + 605 + 660 + 726 + 1210 + 1452 + 1815 + 2420 + 3630 + 7260 = 22344.
Nearby Examples
Related Operations for 7260
- Multiples of 7260 — "outward" complement; M is a multiple of 7260 ⇔ 7260 is a divisor of M
- 7260 Prime Factorization — decompose into prime building blocks
- Find GCF of 7260 and another number
- Find LCM of 7260 and another number
- Is 7260 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