Divisors of 18928: All 30 Factors
Quick Answer
18928 has 30 divisors (factors): 1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 52, 56, 91, 104, 112, 169, 182, 208, 338, 364, 676, 728, 1183, 1352, 1456, 2366, 2704, 4732, 9464, 18928.
Sum: 45384.
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 18928
The number 18928 has 30 divisors:
1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 52, 56, 91, 104, 112, 169, 182, 208, 338, 364, 676, 728, 1183, 1352, 1456, 2366, 2704, 4732, 9464, 18928
Divisor Pairs of 18928
Each pair multiplies to 18928:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 18928 | = | 18928 |
| 2 | × | 9464 | = | 18928 |
| 4 | × | 4732 | = | 18928 |
| 7 | × | 2704 | = | 18928 |
| 8 | × | 2366 | = | 18928 |
| 13 | × | 1456 | = | 18928 |
| 14 | × | 1352 | = | 18928 |
| 16 | × | 1183 | = | 18928 |
| 26 | × | 728 | = | 18928 |
| 28 | × | 676 | = | 18928 |
| 52 | × | 364 | = | 18928 |
| 56 | × | 338 | = | 18928 |
| 91 | × | 208 | = | 18928 |
| 104 | × | 182 | = | 18928 |
| 112 | × | 169 | = | 18928 |
Number of Divisors
The number 18928 has 30 divisors, written as τ(18928) = 30 in number theory.
Sum of Divisors
σ(18928) = 1 + 2 + 4 + 7 + 8 + 13 + 14 + 16 + 26 + 28 + 52 + 56 + 91 + 104 + 112 + 169 + 182 + 208 + 338 + 364 + 676 + 728 + 1183 + 1352 + 1456 + 2366 + 2704 + 4732 + 9464 + 18928 = 45384
Prime Factorization of 18928
Properties of 18928
- 18928 is composite.
- 18928 is not a perfect square.
- Number of divisors: 30.
- Sum of divisors: 45384.
Common Divisors with Another Number?
Looking for the divisors that 18928 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 18928
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √18928 ≈ 137.58. If i divides 18928, then both i and 18928/i are divisors.
- 1 divides 18928 (18928 ÷ 1 = 18928) → pair (1, 18928)
- 2 divides 18928 (18928 ÷ 2 = 9464) → pair (2, 9464)
- 4 divides 18928 (18928 ÷ 4 = 4732) → pair (4, 4732)
- 7 divides 18928 (18928 ÷ 7 = 2704) → pair (7, 2704)
- 8 divides 18928 (18928 ÷ 8 = 2366) → pair (8, 2366)
- 13 divides 18928 (18928 ÷ 13 = 1456) → pair (13, 1456)
- 14 divides 18928 (18928 ÷ 14 = 1352) → pair (14, 1352)
- 16 divides 18928 (18928 ÷ 16 = 1183) → pair (16, 1183)
- 26 divides 18928 (18928 ÷ 26 = 728) → pair (26, 728)
- 28 divides 18928 (18928 ÷ 28 = 676) → pair (28, 676)
- 52 divides 18928 (18928 ÷ 52 = 364) → pair (52, 364)
- 56 divides 18928 (18928 ÷ 56 = 338) → pair (56, 338)
- 91 divides 18928 (18928 ÷ 91 = 208) → pair (91, 208)
- 104 divides 18928 (18928 ÷ 104 = 182) → pair (104, 182)
- 112 divides 18928 (18928 ÷ 112 = 169) → pair (112, 169)
- Collect all unique values: {1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 52, 56, 91, 104, 112, 169, 182, 208, 338, 364, 676, 728, 1183, 1352, 1456, 2366, 2704, 4732, 9464, 18928} — total 30 divisors.
- Sum: 1 + 2 + 4 + 7 + 8 + 13 + 14 + 16 + 26 + 28 + 52 + 56 + 91 + 104 + 112 + 169 + 182 + 208 + 338 + 364 + 676 + 728 + 1183 + 1352 + 1456 + 2366 + 2704 + 4732 + 9464 + 18928 = 45384.
Nearby Examples
Related Operations for 18928
- Multiples of a Number — "outward" complement of divisors
- 18928 Prime Factorization — decompose into prime building blocks
- Find GCF of 18928 and another number
- Find LCM of 18928 and another number
- Is 18928 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