Divisors of 58065: All 24 Factors
Quick Answer
58065 has 24 divisors (factors): 1, 3, 5, 7, 15, 21, 35, 49, 79, 105, 147, 237, 245, 395, 553, 735, 1185, 1659, 2765, 3871, 8295, 11613, 19355, 58065.
Sum: 109440.
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 58065
The number 58065 has 24 divisors:
1, 3, 5, 7, 15, 21, 35, 49, 79, 105, 147, 237, 245, 395, 553, 735, 1185, 1659, 2765, 3871, 8295, 11613, 19355, 58065
Divisor Pairs of 58065
Each pair multiplies to 58065:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 58065 | = | 58065 |
| 3 | × | 19355 | = | 58065 |
| 5 | × | 11613 | = | 58065 |
| 7 | × | 8295 | = | 58065 |
| 15 | × | 3871 | = | 58065 |
| 21 | × | 2765 | = | 58065 |
| 35 | × | 1659 | = | 58065 |
| 49 | × | 1185 | = | 58065 |
| 79 | × | 735 | = | 58065 |
| 105 | × | 553 | = | 58065 |
| 147 | × | 395 | = | 58065 |
| 237 | × | 245 | = | 58065 |
Number of Divisors
The number 58065 has 24 divisors, written as τ(58065) = 24 in number theory.
Sum of Divisors
σ(58065) = 1 + 3 + 5 + 7 + 15 + 21 + 35 + 49 + 79 + 105 + 147 + 237 + 245 + 395 + 553 + 735 + 1185 + 1659 + 2765 + 3871 + 8295 + 11613 + 19355 + 58065 = 109440
Prime Factorization of 58065
Properties of 58065
- 58065 is composite.
- 58065 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 109440.
Common Divisors with Another Number?
Looking for the divisors that 58065 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 58065
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √58065 ≈ 240.97. If i divides 58065, then both i and 58065/i are divisors.
- 1 divides 58065 (58065 ÷ 1 = 58065) → pair (1, 58065)
- 3 divides 58065 (58065 ÷ 3 = 19355) → pair (3, 19355)
- 5 divides 58065 (58065 ÷ 5 = 11613) → pair (5, 11613)
- 7 divides 58065 (58065 ÷ 7 = 8295) → pair (7, 8295)
- 15 divides 58065 (58065 ÷ 15 = 3871) → pair (15, 3871)
- 21 divides 58065 (58065 ÷ 21 = 2765) → pair (21, 2765)
- 35 divides 58065 (58065 ÷ 35 = 1659) → pair (35, 1659)
- 49 divides 58065 (58065 ÷ 49 = 1185) → pair (49, 1185)
- 79 divides 58065 (58065 ÷ 79 = 735) → pair (79, 735)
- 105 divides 58065 (58065 ÷ 105 = 553) → pair (105, 553)
- 147 divides 58065 (58065 ÷ 147 = 395) → pair (147, 395)
- 237 divides 58065 (58065 ÷ 237 = 245) → pair (237, 245)
- Collect all unique values: {1, 3, 5, 7, 15, 21, 35, 49, 79, 105, 147, 237, 245, 395, 553, 735, 1185, 1659, 2765, 3871, 8295, 11613, 19355, 58065} — total 24 divisors.
- Sum: 1 + 3 + 5 + 7 + 15 + 21 + 35 + 49 + 79 + 105 + 147 + 237 + 245 + 395 + 553 + 735 + 1185 + 1659 + 2765 + 3871 + 8295 + 11613 + 19355 + 58065 = 109440.
Nearby Examples
Related Operations for 58065
- Multiples of a Number — "outward" complement of divisors
- 58065 Prime Factorization — decompose into prime building blocks
- Find GCF of 58065 and another number
- Find LCM of 58065 and another number
- Is 58065 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