Divisors of 50240: All 28 Factors
Quick Answer
50240 has 28 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 157, 160, 314, 320, 628, 785, 1256, 1570, 2512, 3140, 5024, 6280, 10048, 12560, 25120, 50240.
Sum: 120396.
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 50240
The number 50240 has 28 divisors:
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 157, 160, 314, 320, 628, 785, 1256, 1570, 2512, 3140, 5024, 6280, 10048, 12560, 25120, 50240
Divisor Pairs of 50240
Each pair multiplies to 50240:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 50240 | = | 50240 |
| 2 | × | 25120 | = | 50240 |
| 4 | × | 12560 | = | 50240 |
| 5 | × | 10048 | = | 50240 |
| 8 | × | 6280 | = | 50240 |
| 10 | × | 5024 | = | 50240 |
| 16 | × | 3140 | = | 50240 |
| 20 | × | 2512 | = | 50240 |
| 32 | × | 1570 | = | 50240 |
| 40 | × | 1256 | = | 50240 |
| 64 | × | 785 | = | 50240 |
| 80 | × | 628 | = | 50240 |
| 157 | × | 320 | = | 50240 |
| 160 | × | 314 | = | 50240 |
Number of Divisors
The number 50240 has 28 divisors, written as τ(50240) = 28 in number theory.
Sum of Divisors
σ(50240) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 157 + 160 + 314 + 320 + 628 + 785 + 1256 + 1570 + 2512 + 3140 + 5024 + 6280 + 10048 + 12560 + 25120 + 50240 = 120396
Prime Factorization of 50240
Properties of 50240
- 50240 is composite.
- 50240 is not a perfect square.
- Number of divisors: 28.
- Sum of divisors: 120396.
Common Divisors with Another Number?
Looking for the divisors that 50240 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 50240
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √50240 ≈ 224.14. If i divides 50240, then both i and 50240/i are divisors.
- 1 divides 50240 (50240 ÷ 1 = 50240) → pair (1, 50240)
- 2 divides 50240 (50240 ÷ 2 = 25120) → pair (2, 25120)
- 4 divides 50240 (50240 ÷ 4 = 12560) → pair (4, 12560)
- 5 divides 50240 (50240 ÷ 5 = 10048) → pair (5, 10048)
- 8 divides 50240 (50240 ÷ 8 = 6280) → pair (8, 6280)
- 10 divides 50240 (50240 ÷ 10 = 5024) → pair (10, 5024)
- 16 divides 50240 (50240 ÷ 16 = 3140) → pair (16, 3140)
- 20 divides 50240 (50240 ÷ 20 = 2512) → pair (20, 2512)
- 32 divides 50240 (50240 ÷ 32 = 1570) → pair (32, 1570)
- 40 divides 50240 (50240 ÷ 40 = 1256) → pair (40, 1256)
- 64 divides 50240 (50240 ÷ 64 = 785) → pair (64, 785)
- 80 divides 50240 (50240 ÷ 80 = 628) → pair (80, 628)
- 157 divides 50240 (50240 ÷ 157 = 320) → pair (157, 320)
- 160 divides 50240 (50240 ÷ 160 = 314) → pair (160, 314)
- Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 157, 160, 314, 320, 628, 785, 1256, 1570, 2512, 3140, 5024, 6280, 10048, 12560, 25120, 50240} — total 28 divisors.
- Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 157 + 160 + 314 + 320 + 628 + 785 + 1256 + 1570 + 2512 + 3140 + 5024 + 6280 + 10048 + 12560 + 25120 + 50240 = 120396.
Nearby Examples
Related Operations for 50240
- Multiples of a Number — "outward" complement of divisors
- 50240 Prime Factorization — decompose into prime building blocks
- Find GCF of 50240 and another number
- Find LCM of 50240 and another number
- Is 50240 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