Divisors of 79000: All 32 Factors
Quick Answer
79000 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 79, 100, 125, 158, 200, 250, 316, 395, 500, 632, 790, 1000, 1580, 1975, 3160, 3950, 7900, 9875, 15800, 19750, 39500, 79000.
Sum: 187200.
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 79000
The number 79000 has 32 divisors:
1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 79, 100, 125, 158, 200, 250, 316, 395, 500, 632, 790, 1000, 1580, 1975, 3160, 3950, 7900, 9875, 15800, 19750, 39500, 79000
Divisor Pairs of 79000
Each pair multiplies to 79000:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 79000 | = | 79000 |
| 2 | × | 39500 | = | 79000 |
| 4 | × | 19750 | = | 79000 |
| 5 | × | 15800 | = | 79000 |
| 8 | × | 9875 | = | 79000 |
| 10 | × | 7900 | = | 79000 |
| 20 | × | 3950 | = | 79000 |
| 25 | × | 3160 | = | 79000 |
| 40 | × | 1975 | = | 79000 |
| 50 | × | 1580 | = | 79000 |
| 79 | × | 1000 | = | 79000 |
| 100 | × | 790 | = | 79000 |
| 125 | × | 632 | = | 79000 |
| 158 | × | 500 | = | 79000 |
| 200 | × | 395 | = | 79000 |
| 250 | × | 316 | = | 79000 |
Number of Divisors
The number 79000 has 32 divisors, written as τ(79000) = 32 in number theory.
Sum of Divisors
σ(79000) = 1 + 2 + 4 + 5 + 8 + 10 + 20 + 25 + 40 + 50 + 79 + 100 + 125 + 158 + 200 + 250 + 316 + 395 + 500 + 632 + 790 + 1000 + 1580 + 1975 + 3160 + 3950 + 7900 + 9875 + 15800 + 19750 + 39500 + 79000 = 187200
Prime Factorization of 79000
Properties of 79000
- 79000 is composite.
- 79000 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 187200.
Common Divisors with Another Number?
Looking for the divisors that 79000 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 79000
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √79000 ≈ 281.07. If i divides 79000, then both i and 79000/i are divisors.
- 1 divides 79000 (79000 ÷ 1 = 79000) → pair (1, 79000)
- 2 divides 79000 (79000 ÷ 2 = 39500) → pair (2, 39500)
- 4 divides 79000 (79000 ÷ 4 = 19750) → pair (4, 19750)
- 5 divides 79000 (79000 ÷ 5 = 15800) → pair (5, 15800)
- 8 divides 79000 (79000 ÷ 8 = 9875) → pair (8, 9875)
- 10 divides 79000 (79000 ÷ 10 = 7900) → pair (10, 7900)
- 20 divides 79000 (79000 ÷ 20 = 3950) → pair (20, 3950)
- 25 divides 79000 (79000 ÷ 25 = 3160) → pair (25, 3160)
- 40 divides 79000 (79000 ÷ 40 = 1975) → pair (40, 1975)
- 50 divides 79000 (79000 ÷ 50 = 1580) → pair (50, 1580)
- 79 divides 79000 (79000 ÷ 79 = 1000) → pair (79, 1000)
- 100 divides 79000 (79000 ÷ 100 = 790) → pair (100, 790)
- 125 divides 79000 (79000 ÷ 125 = 632) → pair (125, 632)
- 158 divides 79000 (79000 ÷ 158 = 500) → pair (158, 500)
- 200 divides 79000 (79000 ÷ 200 = 395) → pair (200, 395)
- 250 divides 79000 (79000 ÷ 250 = 316) → pair (250, 316)
- Collect all unique values: {1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 79, 100, 125, 158, 200, 250, 316, 395, 500, 632, 790, 1000, 1580, 1975, 3160, 3950, 7900, 9875, 15800, 19750, 39500, 79000} — total 32 divisors.
- Sum: 1 + 2 + 4 + 5 + 8 + 10 + 20 + 25 + 40 + 50 + 79 + 100 + 125 + 158 + 200 + 250 + 316 + 395 + 500 + 632 + 790 + 1000 + 1580 + 1975 + 3160 + 3950 + 7900 + 9875 + 15800 + 19750 + 39500 + 79000 = 187200.
Nearby Examples
Related Operations for 79000
- Multiples of a Number — "outward" complement of divisors
- 79000 Prime Factorization — decompose into prime building blocks
- Find GCF of 79000 and another number
- Find LCM of 79000 and another number
- Is 79000 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