Divisors of 7590: All 32 Factors
Quick Answer
7590 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 11, 15, 22, 23, 30, 33, 46, 55, 66, 69, 110, 115, 138, 165, 230, 253, 330, 345, 506, 690, 759, 1265, 1518, 2530, 3795, 7590.
Sum: 20736.
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 7590
The number 7590 has 32 divisors:
1, 2, 3, 5, 6, 10, 11, 15, 22, 23, 30, 33, 46, 55, 66, 69, 110, 115, 138, 165, 230, 253, 330, 345, 506, 690, 759, 1265, 1518, 2530, 3795, 7590
Divisor Pairs of 7590
Each pair multiplies to 7590:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 7590 | = | 7590 |
| 2 | × | 3795 | = | 7590 |
| 3 | × | 2530 | = | 7590 |
| 5 | × | 1518 | = | 7590 |
| 6 | × | 1265 | = | 7590 |
| 10 | × | 759 | = | 7590 |
| 11 | × | 690 | = | 7590 |
| 15 | × | 506 | = | 7590 |
| 22 | × | 345 | = | 7590 |
| 23 | × | 330 | = | 7590 |
| 30 | × | 253 | = | 7590 |
| 33 | × | 230 | = | 7590 |
| 46 | × | 165 | = | 7590 |
| 55 | × | 138 | = | 7590 |
| 66 | × | 115 | = | 7590 |
| 69 | × | 110 | = | 7590 |
Number of Divisors
The number 7590 has 32 divisors, written as τ(7590) = 32 in number theory.
Sum of Divisors
σ(7590) = 1 + 2 + 3 + 5 + 6 + 10 + 11 + 15 + 22 + 23 + 30 + 33 + 46 + 55 + 66 + 69 + 110 + 115 + 138 + 165 + 230 + 253 + 330 + 345 + 506 + 690 + 759 + 1265 + 1518 + 2530 + 3795 + 7590 = 20736
Prime Factorization of 7590
Properties of 7590
- 7590 is composite.
- 7590 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 20736.
Common Divisors with Another Number?
Looking for the divisors that 7590 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 7590
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √7590 ≈ 87.12. If i divides 7590, then both i and 7590/i are divisors.
- 1 divides 7590 (7590 ÷ 1 = 7590) → pair (1, 7590)
- 2 divides 7590 (7590 ÷ 2 = 3795) → pair (2, 3795)
- 3 divides 7590 (7590 ÷ 3 = 2530) → pair (3, 2530)
- 5 divides 7590 (7590 ÷ 5 = 1518) → pair (5, 1518)
- 6 divides 7590 (7590 ÷ 6 = 1265) → pair (6, 1265)
- 10 divides 7590 (7590 ÷ 10 = 759) → pair (10, 759)
- 11 divides 7590 (7590 ÷ 11 = 690) → pair (11, 690)
- 15 divides 7590 (7590 ÷ 15 = 506) → pair (15, 506)
- 22 divides 7590 (7590 ÷ 22 = 345) → pair (22, 345)
- 23 divides 7590 (7590 ÷ 23 = 330) → pair (23, 330)
- 30 divides 7590 (7590 ÷ 30 = 253) → pair (30, 253)
- 33 divides 7590 (7590 ÷ 33 = 230) → pair (33, 230)
- 46 divides 7590 (7590 ÷ 46 = 165) → pair (46, 165)
- 55 divides 7590 (7590 ÷ 55 = 138) → pair (55, 138)
- 66 divides 7590 (7590 ÷ 66 = 115) → pair (66, 115)
- 69 divides 7590 (7590 ÷ 69 = 110) → pair (69, 110)
- Collect all unique values: {1, 2, 3, 5, 6, 10, 11, 15, 22, 23, 30, 33, 46, 55, 66, 69, 110, 115, 138, 165, 230, 253, 330, 345, 506, 690, 759, 1265, 1518, 2530, 3795, 7590} — total 32 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 10 + 11 + 15 + 22 + 23 + 30 + 33 + 46 + 55 + 66 + 69 + 110 + 115 + 138 + 165 + 230 + 253 + 330 + 345 + 506 + 690 + 759 + 1265 + 1518 + 2530 + 3795 + 7590 = 20736.
Nearby Examples
Related Operations for 7590
- Multiples of 7590 — "outward" complement; M is a multiple of 7590 ⇔ 7590 is a divisor of M
- 7590 Prime Factorization — decompose into prime building blocks
- Find GCF of 7590 and another number
- Find LCM of 7590 and another number
- Is 7590 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