Divisors of 60516: All 27 Factors
Quick Answer
60516 has 27 divisors (factors): 1, 2, 3, 4, 6, 9, 12, 18, 36, 41, 82, 123, 164, 246, 369, 492, 738, 1476, 1681, 3362, 5043, 6724, 10086, 15129, 20172, 30258, 60516.
Sum: 156793. 60516 is a perfect square (√60516 = 246).
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 60516
The number 60516 has 27 divisors:
1, 2, 3, 4, 6, 9, 12, 18, 36, 41, 82, 123, 164, 246, 369, 492, 738, 1476, 1681, 3362, 5043, 6724, 10086, 15129, 20172, 30258, 60516
Divisor Pairs of 60516
Each pair multiplies to 60516:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 60516 | = | 60516 |
| 2 | × | 30258 | = | 60516 |
| 3 | × | 20172 | = | 60516 |
| 4 | × | 15129 | = | 60516 |
| 6 | × | 10086 | = | 60516 |
| 9 | × | 6724 | = | 60516 |
| 12 | × | 5043 | = | 60516 |
| 18 | × | 3362 | = | 60516 |
| 36 | × | 1681 | = | 60516 |
| 41 | × | 1476 | = | 60516 |
| 82 | × | 738 | = | 60516 |
| 123 | × | 492 | = | 60516 |
| 164 | × | 369 | = | 60516 |
| 246 | × | 246 | = | 60516 |
Note: the last pair has identical factors (246 × 246) because 60516 is a perfect square.
Number of Divisors
The number 60516 has 27 divisors, written as τ(60516) = 27 in number theory.
⚡ Notice: 60516 has an odd number of divisors — this means 60516 is a perfect square (√60516 = 246).
Sum of Divisors
σ(60516) = 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 36 + 41 + 82 + 123 + 164 + 246 + 369 + 492 + 738 + 1476 + 1681 + 3362 + 5043 + 6724 + 10086 + 15129 + 20172 + 30258 + 60516 = 156793
Prime Factorization of 60516
Properties of 60516
- 60516 is composite.
- 60516 is a perfect square (√60516 = 246).
- Number of divisors: 27.
- Sum of divisors: 156793.
Common Divisors with Another Number?
Looking for the divisors that 60516 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 60516
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √60516 ≈ 246.00. If i divides 60516, then both i and 60516/i are divisors.
- 1 divides 60516 (60516 ÷ 1 = 60516) → pair (1, 60516)
- 2 divides 60516 (60516 ÷ 2 = 30258) → pair (2, 30258)
- 3 divides 60516 (60516 ÷ 3 = 20172) → pair (3, 20172)
- 4 divides 60516 (60516 ÷ 4 = 15129) → pair (4, 15129)
- 6 divides 60516 (60516 ÷ 6 = 10086) → pair (6, 10086)
- 9 divides 60516 (60516 ÷ 9 = 6724) → pair (9, 6724)
- 12 divides 60516 (60516 ÷ 12 = 5043) → pair (12, 5043)
- 18 divides 60516 (60516 ÷ 18 = 3362) → pair (18, 3362)
- 36 divides 60516 (60516 ÷ 36 = 1681) → pair (36, 1681)
- 41 divides 60516 (60516 ÷ 41 = 1476) → pair (41, 1476)
- 82 divides 60516 (60516 ÷ 82 = 738) → pair (82, 738)
- 123 divides 60516 (60516 ÷ 123 = 492) → pair (123, 492)
- 164 divides 60516 (60516 ÷ 164 = 369) → pair (164, 369)
- 246 divides 60516 (60516 ÷ 246 = 246) → pair (246, 246)
- Collect all unique values: {1, 2, 3, 4, 6, 9, 12, 18, 36, 41, 82, 123, 164, 246, 369, 492, 738, 1476, 1681, 3362, 5043, 6724, 10086, 15129, 20172, 30258, 60516} — total 27 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 36 + 41 + 82 + 123 + 164 + 246 + 369 + 492 + 738 + 1476 + 1681 + 3362 + 5043 + 6724 + 10086 + 15129 + 20172 + 30258 + 60516 = 156793.
Nearby Examples
Related Operations for 60516
- Multiples of a Number — "outward" complement of divisors
- 60516 Prime Factorization — decompose into prime building blocks
- Find GCF of 60516 and another number
- Find LCM of 60516 and another number
- Is 60516 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