Divisors of 50085: All 32 Factors
Quick Answer
50085 has 32 divisors (factors): 1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 53, 63, 105, 135, 159, 189, 265, 315, 371, 477, 795, 945, 1113, 1431, 1855, 2385, 3339, 5565, 7155, 10017, 16695, 50085.
Sum: 103680.
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 50085
The number 50085 has 32 divisors:
1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 53, 63, 105, 135, 159, 189, 265, 315, 371, 477, 795, 945, 1113, 1431, 1855, 2385, 3339, 5565, 7155, 10017, 16695, 50085
Divisor Pairs of 50085
Each pair multiplies to 50085:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 50085 | = | 50085 |
| 3 | × | 16695 | = | 50085 |
| 5 | × | 10017 | = | 50085 |
| 7 | × | 7155 | = | 50085 |
| 9 | × | 5565 | = | 50085 |
| 15 | × | 3339 | = | 50085 |
| 21 | × | 2385 | = | 50085 |
| 27 | × | 1855 | = | 50085 |
| 35 | × | 1431 | = | 50085 |
| 45 | × | 1113 | = | 50085 |
| 53 | × | 945 | = | 50085 |
| 63 | × | 795 | = | 50085 |
| 105 | × | 477 | = | 50085 |
| 135 | × | 371 | = | 50085 |
| 159 | × | 315 | = | 50085 |
| 189 | × | 265 | = | 50085 |
Number of Divisors
The number 50085 has 32 divisors, written as τ(50085) = 32 in number theory.
Sum of Divisors
σ(50085) = 1 + 3 + 5 + 7 + 9 + 15 + 21 + 27 + 35 + 45 + 53 + 63 + 105 + 135 + 159 + 189 + 265 + 315 + 371 + 477 + 795 + 945 + 1113 + 1431 + 1855 + 2385 + 3339 + 5565 + 7155 + 10017 + 16695 + 50085 = 103680
Prime Factorization of 50085
Properties of 50085
- 50085 is composite.
- 50085 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 103680.
Common Divisors with Another Number?
Looking for the divisors that 50085 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 50085
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √50085 ≈ 223.80. If i divides 50085, then both i and 50085/i are divisors.
- 1 divides 50085 (50085 ÷ 1 = 50085) → pair (1, 50085)
- 3 divides 50085 (50085 ÷ 3 = 16695) → pair (3, 16695)
- 5 divides 50085 (50085 ÷ 5 = 10017) → pair (5, 10017)
- 7 divides 50085 (50085 ÷ 7 = 7155) → pair (7, 7155)
- 9 divides 50085 (50085 ÷ 9 = 5565) → pair (9, 5565)
- 15 divides 50085 (50085 ÷ 15 = 3339) → pair (15, 3339)
- 21 divides 50085 (50085 ÷ 21 = 2385) → pair (21, 2385)
- 27 divides 50085 (50085 ÷ 27 = 1855) → pair (27, 1855)
- 35 divides 50085 (50085 ÷ 35 = 1431) → pair (35, 1431)
- 45 divides 50085 (50085 ÷ 45 = 1113) → pair (45, 1113)
- 53 divides 50085 (50085 ÷ 53 = 945) → pair (53, 945)
- 63 divides 50085 (50085 ÷ 63 = 795) → pair (63, 795)
- 105 divides 50085 (50085 ÷ 105 = 477) → pair (105, 477)
- 135 divides 50085 (50085 ÷ 135 = 371) → pair (135, 371)
- 159 divides 50085 (50085 ÷ 159 = 315) → pair (159, 315)
- 189 divides 50085 (50085 ÷ 189 = 265) → pair (189, 265)
- Collect all unique values: {1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 53, 63, 105, 135, 159, 189, 265, 315, 371, 477, 795, 945, 1113, 1431, 1855, 2385, 3339, 5565, 7155, 10017, 16695, 50085} — total 32 divisors.
- Sum: 1 + 3 + 5 + 7 + 9 + 15 + 21 + 27 + 35 + 45 + 53 + 63 + 105 + 135 + 159 + 189 + 265 + 315 + 371 + 477 + 795 + 945 + 1113 + 1431 + 1855 + 2385 + 3339 + 5565 + 7155 + 10017 + 16695 + 50085 = 103680.
Nearby Examples
Related Operations for 50085
- Multiples of a Number — "outward" complement of divisors
- 50085 Prime Factorization — decompose into prime building blocks
- Find GCF of 50085 and another number
- Find LCM of 50085 and another number
- Is 50085 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