Divisors of 7098: All 24 Factors
Quick Answer
7098 has 24 divisors (factors): 1, 2, 3, 6, 7, 13, 14, 21, 26, 39, 42, 78, 91, 169, 182, 273, 338, 507, 546, 1014, 1183, 2366, 3549, 7098.
Sum: 17568.
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 7098
The number 7098 has 24 divisors:
1, 2, 3, 6, 7, 13, 14, 21, 26, 39, 42, 78, 91, 169, 182, 273, 338, 507, 546, 1014, 1183, 2366, 3549, 7098
Divisor Pairs of 7098
Each pair multiplies to 7098:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 7098 | = | 7098 |
| 2 | × | 3549 | = | 7098 |
| 3 | × | 2366 | = | 7098 |
| 6 | × | 1183 | = | 7098 |
| 7 | × | 1014 | = | 7098 |
| 13 | × | 546 | = | 7098 |
| 14 | × | 507 | = | 7098 |
| 21 | × | 338 | = | 7098 |
| 26 | × | 273 | = | 7098 |
| 39 | × | 182 | = | 7098 |
| 42 | × | 169 | = | 7098 |
| 78 | × | 91 | = | 7098 |
Number of Divisors
The number 7098 has 24 divisors, written as τ(7098) = 24 in number theory.
Sum of Divisors
σ(7098) = 1 + 2 + 3 + 6 + 7 + 13 + 14 + 21 + 26 + 39 + 42 + 78 + 91 + 169 + 182 + 273 + 338 + 507 + 546 + 1014 + 1183 + 2366 + 3549 + 7098 = 17568
Prime Factorization of 7098
Properties of 7098
- 7098 is composite.
- 7098 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 17568.
Common Divisors with Another Number?
Looking for the divisors that 7098 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 7098
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √7098 ≈ 84.25. If i divides 7098, then both i and 7098/i are divisors.
- 1 divides 7098 (7098 ÷ 1 = 7098) → pair (1, 7098)
- 2 divides 7098 (7098 ÷ 2 = 3549) → pair (2, 3549)
- 3 divides 7098 (7098 ÷ 3 = 2366) → pair (3, 2366)
- 6 divides 7098 (7098 ÷ 6 = 1183) → pair (6, 1183)
- 7 divides 7098 (7098 ÷ 7 = 1014) → pair (7, 1014)
- 13 divides 7098 (7098 ÷ 13 = 546) → pair (13, 546)
- 14 divides 7098 (7098 ÷ 14 = 507) → pair (14, 507)
- 21 divides 7098 (7098 ÷ 21 = 338) → pair (21, 338)
- 26 divides 7098 (7098 ÷ 26 = 273) → pair (26, 273)
- 39 divides 7098 (7098 ÷ 39 = 182) → pair (39, 182)
- 42 divides 7098 (7098 ÷ 42 = 169) → pair (42, 169)
- 78 divides 7098 (7098 ÷ 78 = 91) → pair (78, 91)
- Collect all unique values: {1, 2, 3, 6, 7, 13, 14, 21, 26, 39, 42, 78, 91, 169, 182, 273, 338, 507, 546, 1014, 1183, 2366, 3549, 7098} — total 24 divisors.
- Sum: 1 + 2 + 3 + 6 + 7 + 13 + 14 + 21 + 26 + 39 + 42 + 78 + 91 + 169 + 182 + 273 + 338 + 507 + 546 + 1014 + 1183 + 2366 + 3549 + 7098 = 17568.
Nearby Examples
Related Operations for 7098
- Multiples of 7098 — "outward" complement; M is a multiple of 7098 ⇔ 7098 is a divisor of M
- 7098 Prime Factorization — decompose into prime building blocks
- Find GCF of 7098 and another number
- Find LCM of 7098 and another number
- Is 7098 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