Divisors of 62160: All 80 Factors
Quick Answer
62160 has 80 divisors (factors): 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 20, 21, 24, 28, 30, 35, 37, 40, 42, 48, 56, 60, 70, 74, 80, 84, 105, 111, 112, 120, 140, 148, 168, 185, 210, 222, 240, 259, 280, 296, 336, 370, 420, 444, 518, 555, 560, 592, 740, 777, 840, 888, 1036, 1110, 1295, 1480, 1554, 1680, 1776, 2072, 2220, 2590, 2960, 3108, 3885, 4144, 4440, 5180, 6216, 7770, 8880, 10360, 12432, 15540, 20720, 31080, 62160.
Sum: 226176.
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 62160
The number 62160 has 80 divisors:
1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 20, 21, 24, 28, 30, 35, 37, 40, 42, 48, 56, 60, 70, 74, 80, 84, 105, 111, 112, 120, 140, 148, 168, 185, 210, 222, 240, 259, 280, 296, 336, 370, 420, 444, 518, 555, 560, 592, 740, 777, 840, 888, 1036, 1110, 1295, 1480, 1554, 1680, 1776, 2072, 2220, 2590, 2960, 3108, 3885, 4144, 4440, 5180, 6216, 7770, 8880, 10360, 12432, 15540, 20720, 31080, 62160
Divisor Pairs of 62160
Each pair multiplies to 62160:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 62160 | = | 62160 |
| 2 | × | 31080 | = | 62160 |
| 3 | × | 20720 | = | 62160 |
| 4 | × | 15540 | = | 62160 |
| 5 | × | 12432 | = | 62160 |
| 6 | × | 10360 | = | 62160 |
| 7 | × | 8880 | = | 62160 |
| 8 | × | 7770 | = | 62160 |
| 10 | × | 6216 | = | 62160 |
| 12 | × | 5180 | = | 62160 |
| 14 | × | 4440 | = | 62160 |
| 15 | × | 4144 | = | 62160 |
| 16 | × | 3885 | = | 62160 |
| 20 | × | 3108 | = | 62160 |
| 21 | × | 2960 | = | 62160 |
| 24 | × | 2590 | = | 62160 |
| 28 | × | 2220 | = | 62160 |
| 30 | × | 2072 | = | 62160 |
| 35 | × | 1776 | = | 62160 |
| 37 | × | 1680 | = | 62160 |
| 40 | × | 1554 | = | 62160 |
| 42 | × | 1480 | = | 62160 |
| 48 | × | 1295 | = | 62160 |
| 56 | × | 1110 | = | 62160 |
| 60 | × | 1036 | = | 62160 |
| 70 | × | 888 | = | 62160 |
| 74 | × | 840 | = | 62160 |
| 80 | × | 777 | = | 62160 |
| 84 | × | 740 | = | 62160 |
| 105 | × | 592 | = | 62160 |
| 111 | × | 560 | = | 62160 |
| 112 | × | 555 | = | 62160 |
| 120 | × | 518 | = | 62160 |
| 140 | × | 444 | = | 62160 |
| 148 | × | 420 | = | 62160 |
| 168 | × | 370 | = | 62160 |
| 185 | × | 336 | = | 62160 |
| 210 | × | 296 | = | 62160 |
| 222 | × | 280 | = | 62160 |
| 240 | × | 259 | = | 62160 |
Number of Divisors
The number 62160 has 80 divisors, written as τ(62160) = 80 in number theory.
Sum of Divisors
σ(62160) = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 10 + 12 + 14 + 15 + 16 + 20 + 21 + 24 + 28 + 30 + 35 + 37 + 40 + 42 + 48 + 56 + 60 + 70 + 74 + 80 + 84 + 105 + 111 + 112 + 120 + 140 + 148 + 168 + 185 + 210 + 222 + 240 + 259 + 280 + 296 + 336 + 370 + 420 + 444 + 518 + 555 + 560 + 592 + 740 + 777 + 840 + 888 + 1036 + 1110 + 1295 + 1480 + 1554 + 1680 + 1776 + 2072 + 2220 + 2590 + 2960 + 3108 + 3885 + 4144 + 4440 + 5180 + 6216 + 7770 + 8880 + 10360 + 12432 + 15540 + 20720 + 31080 + 62160 = 226176
Prime Factorization of 62160
Properties of 62160
- 62160 is composite.
- 62160 is not a perfect square.
- Number of divisors: 80.
- Sum of divisors: 226176.
Common Divisors with Another Number?
Looking for the divisors that 62160 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 62160
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √62160 ≈ 249.32. If i divides 62160, then both i and 62160/i are divisors.
- 1 divides 62160 (62160 ÷ 1 = 62160) → pair (1, 62160)
- 2 divides 62160 (62160 ÷ 2 = 31080) → pair (2, 31080)
- 3 divides 62160 (62160 ÷ 3 = 20720) → pair (3, 20720)
- 4 divides 62160 (62160 ÷ 4 = 15540) → pair (4, 15540)
- 5 divides 62160 (62160 ÷ 5 = 12432) → pair (5, 12432)
- 6 divides 62160 (62160 ÷ 6 = 10360) → pair (6, 10360)
- 7 divides 62160 (62160 ÷ 7 = 8880) → pair (7, 8880)
- 8 divides 62160 (62160 ÷ 8 = 7770) → pair (8, 7770)
- 10 divides 62160 (62160 ÷ 10 = 6216) → pair (10, 6216)
- 12 divides 62160 (62160 ÷ 12 = 5180) → pair (12, 5180)
- 14 divides 62160 (62160 ÷ 14 = 4440) → pair (14, 4440)
- 15 divides 62160 (62160 ÷ 15 = 4144) → pair (15, 4144)
- 16 divides 62160 (62160 ÷ 16 = 3885) → pair (16, 3885)
- 20 divides 62160 (62160 ÷ 20 = 3108) → pair (20, 3108)
- 21 divides 62160 (62160 ÷ 21 = 2960) → pair (21, 2960)
- 24 divides 62160 (62160 ÷ 24 = 2590) → pair (24, 2590)
- 28 divides 62160 (62160 ÷ 28 = 2220) → pair (28, 2220)
- 30 divides 62160 (62160 ÷ 30 = 2072) → pair (30, 2072)
- 35 divides 62160 (62160 ÷ 35 = 1776) → pair (35, 1776)
- 37 divides 62160 (62160 ÷ 37 = 1680) → pair (37, 1680)
- 40 divides 62160 (62160 ÷ 40 = 1554) → pair (40, 1554)
- 42 divides 62160 (62160 ÷ 42 = 1480) → pair (42, 1480)
- 48 divides 62160 (62160 ÷ 48 = 1295) → pair (48, 1295)
- 56 divides 62160 (62160 ÷ 56 = 1110) → pair (56, 1110)
- 60 divides 62160 (62160 ÷ 60 = 1036) → pair (60, 1036)
- 70 divides 62160 (62160 ÷ 70 = 888) → pair (70, 888)
- 74 divides 62160 (62160 ÷ 74 = 840) → pair (74, 840)
- 80 divides 62160 (62160 ÷ 80 = 777) → pair (80, 777)
- 84 divides 62160 (62160 ÷ 84 = 740) → pair (84, 740)
- 105 divides 62160 (62160 ÷ 105 = 592) → pair (105, 592)
- 111 divides 62160 (62160 ÷ 111 = 560) → pair (111, 560)
- 112 divides 62160 (62160 ÷ 112 = 555) → pair (112, 555)
- 120 divides 62160 (62160 ÷ 120 = 518) → pair (120, 518)
- 140 divides 62160 (62160 ÷ 140 = 444) → pair (140, 444)
- 148 divides 62160 (62160 ÷ 148 = 420) → pair (148, 420)
- 168 divides 62160 (62160 ÷ 168 = 370) → pair (168, 370)
- 185 divides 62160 (62160 ÷ 185 = 336) → pair (185, 336)
- 210 divides 62160 (62160 ÷ 210 = 296) → pair (210, 296)
- 222 divides 62160 (62160 ÷ 222 = 280) → pair (222, 280)
- 240 divides 62160 (62160 ÷ 240 = 259) → pair (240, 259)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 20, 21, 24, 28, 30, 35, 37, 40, 42, 48, 56, 60, 70, 74, 80, 84, 105, 111, 112, 120, 140, 148, 168, 185, 210, 222, 240, 259, 280, 296, 336, 370, 420, 444, 518, 555, 560, 592, 740, 777, 840, 888, 1036, 1110, 1295, 1480, 1554, 1680, 1776, 2072, 2220, 2590, 2960, 3108, 3885, 4144, 4440, 5180, 6216, 7770, 8880, 10360, 12432, 15540, 20720, 31080, 62160} — total 80 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 10 + 12 + 14 + 15 + 16 + 20 + 21 + 24 + 28 + 30 + 35 + 37 + 40 + 42 + 48 + 56 + 60 + 70 + 74 + 80 + 84 + 105 + 111 + 112 + 120 + 140 + 148 + 168 + 185 + 210 + 222 + 240 + 259 + 280 + 296 + 336 + 370 + 420 + 444 + 518 + 555 + 560 + 592 + 740 + 777 + 840 + 888 + 1036 + 1110 + 1295 + 1480 + 1554 + 1680 + 1776 + 2072 + 2220 + 2590 + 2960 + 3108 + 3885 + 4144 + 4440 + 5180 + 6216 + 7770 + 8880 + 10360 + 12432 + 15540 + 20720 + 31080 + 62160 = 226176.
Nearby Examples
Related Operations for 62160
- Multiples of a Number — "outward" complement of divisors
- 62160 Prime Factorization — decompose into prime building blocks
- Find GCF of 62160 and another number
- Find LCM of 62160 and another number
- Is 62160 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