Divisors of 50250: All 32 Factors
Quick Answer
50250 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 67, 75, 125, 134, 150, 201, 250, 335, 375, 402, 670, 750, 1005, 1675, 2010, 3350, 5025, 8375, 10050, 16750, 25125, 50250.
Sum: 127296.
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 50250
The number 50250 has 32 divisors:
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 67, 75, 125, 134, 150, 201, 250, 335, 375, 402, 670, 750, 1005, 1675, 2010, 3350, 5025, 8375, 10050, 16750, 25125, 50250
Divisor Pairs of 50250
Each pair multiplies to 50250:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 50250 | = | 50250 |
| 2 | × | 25125 | = | 50250 |
| 3 | × | 16750 | = | 50250 |
| 5 | × | 10050 | = | 50250 |
| 6 | × | 8375 | = | 50250 |
| 10 | × | 5025 | = | 50250 |
| 15 | × | 3350 | = | 50250 |
| 25 | × | 2010 | = | 50250 |
| 30 | × | 1675 | = | 50250 |
| 50 | × | 1005 | = | 50250 |
| 67 | × | 750 | = | 50250 |
| 75 | × | 670 | = | 50250 |
| 125 | × | 402 | = | 50250 |
| 134 | × | 375 | = | 50250 |
| 150 | × | 335 | = | 50250 |
| 201 | × | 250 | = | 50250 |
Number of Divisors
The number 50250 has 32 divisors, written as τ(50250) = 32 in number theory.
Sum of Divisors
σ(50250) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 50 + 67 + 75 + 125 + 134 + 150 + 201 + 250 + 335 + 375 + 402 + 670 + 750 + 1005 + 1675 + 2010 + 3350 + 5025 + 8375 + 10050 + 16750 + 25125 + 50250 = 127296
Prime Factorization of 50250
Properties of 50250
- 50250 is composite.
- 50250 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 127296.
Common Divisors with Another Number?
Looking for the divisors that 50250 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 50250
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √50250 ≈ 224.17. If i divides 50250, then both i and 50250/i are divisors.
- 1 divides 50250 (50250 ÷ 1 = 50250) → pair (1, 50250)
- 2 divides 50250 (50250 ÷ 2 = 25125) → pair (2, 25125)
- 3 divides 50250 (50250 ÷ 3 = 16750) → pair (3, 16750)
- 5 divides 50250 (50250 ÷ 5 = 10050) → pair (5, 10050)
- 6 divides 50250 (50250 ÷ 6 = 8375) → pair (6, 8375)
- 10 divides 50250 (50250 ÷ 10 = 5025) → pair (10, 5025)
- 15 divides 50250 (50250 ÷ 15 = 3350) → pair (15, 3350)
- 25 divides 50250 (50250 ÷ 25 = 2010) → pair (25, 2010)
- 30 divides 50250 (50250 ÷ 30 = 1675) → pair (30, 1675)
- 50 divides 50250 (50250 ÷ 50 = 1005) → pair (50, 1005)
- 67 divides 50250 (50250 ÷ 67 = 750) → pair (67, 750)
- 75 divides 50250 (50250 ÷ 75 = 670) → pair (75, 670)
- 125 divides 50250 (50250 ÷ 125 = 402) → pair (125, 402)
- 134 divides 50250 (50250 ÷ 134 = 375) → pair (134, 375)
- 150 divides 50250 (50250 ÷ 150 = 335) → pair (150, 335)
- 201 divides 50250 (50250 ÷ 201 = 250) → pair (201, 250)
- Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 67, 75, 125, 134, 150, 201, 250, 335, 375, 402, 670, 750, 1005, 1675, 2010, 3350, 5025, 8375, 10050, 16750, 25125, 50250} — total 32 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 25 + 30 + 50 + 67 + 75 + 125 + 134 + 150 + 201 + 250 + 335 + 375 + 402 + 670 + 750 + 1005 + 1675 + 2010 + 3350 + 5025 + 8375 + 10050 + 16750 + 25125 + 50250 = 127296.
Nearby Examples
Related Operations for 50250
- Multiples of a Number — "outward" complement of divisors
- 50250 Prime Factorization — decompose into prime building blocks
- Find GCF of 50250 and another number
- Find LCM of 50250 and another number
- Is 50250 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