Divisors of 19551: All 16 Factors
Quick Answer
19551 has 16 divisors (factors): 1, 3, 7, 19, 21, 49, 57, 133, 147, 343, 399, 931, 1029, 2793, 6517, 19551.
Sum: 32000.
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 19551
The number 19551 has 16 divisors:
1, 3, 7, 19, 21, 49, 57, 133, 147, 343, 399, 931, 1029, 2793, 6517, 19551
Divisor Pairs of 19551
Each pair multiplies to 19551:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 19551 | = | 19551 |
| 3 | × | 6517 | = | 19551 |
| 7 | × | 2793 | = | 19551 |
| 19 | × | 1029 | = | 19551 |
| 21 | × | 931 | = | 19551 |
| 49 | × | 399 | = | 19551 |
| 57 | × | 343 | = | 19551 |
| 133 | × | 147 | = | 19551 |
Number of Divisors
The number 19551 has 16 divisors, written as τ(19551) = 16 in number theory.
Sum of Divisors
σ(19551) = 1 + 3 + 7 + 19 + 21 + 49 + 57 + 133 + 147 + 343 + 399 + 931 + 1029 + 2793 + 6517 + 19551 = 32000
Prime Factorization of 19551
Properties of 19551
- 19551 is composite.
- 19551 is not a perfect square.
- Number of divisors: 16.
- Sum of divisors: 32000.
Common Divisors with Another Number?
Looking for the divisors that 19551 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 19551
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √19551 ≈ 139.82. If i divides 19551, then both i and 19551/i are divisors.
- 1 divides 19551 (19551 ÷ 1 = 19551) → pair (1, 19551)
- 3 divides 19551 (19551 ÷ 3 = 6517) → pair (3, 6517)
- 7 divides 19551 (19551 ÷ 7 = 2793) → pair (7, 2793)
- 19 divides 19551 (19551 ÷ 19 = 1029) → pair (19, 1029)
- 21 divides 19551 (19551 ÷ 21 = 931) → pair (21, 931)
- 49 divides 19551 (19551 ÷ 49 = 399) → pair (49, 399)
- 57 divides 19551 (19551 ÷ 57 = 343) → pair (57, 343)
- 133 divides 19551 (19551 ÷ 133 = 147) → pair (133, 147)
- Collect all unique values: {1, 3, 7, 19, 21, 49, 57, 133, 147, 343, 399, 931, 1029, 2793, 6517, 19551} — total 16 divisors.
- Sum: 1 + 3 + 7 + 19 + 21 + 49 + 57 + 133 + 147 + 343 + 399 + 931 + 1029 + 2793 + 6517 + 19551 = 32000.
Nearby Examples
Related Operations for 19551
- Multiples of a Number — "outward" complement of divisors
- 19551 Prime Factorization — decompose into prime building blocks
- Find GCF of 19551 and another number
- Find LCM of 19551 and another number
- Is 19551 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