Divisors of 16767: All 14 Factors
Quick Answer
16767 has 14 divisors (factors): 1, 3, 9, 23, 27, 69, 81, 207, 243, 621, 729, 1863, 5589, 16767.
Sum: 26232.
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 16767
The number 16767 has 14 divisors:
1, 3, 9, 23, 27, 69, 81, 207, 243, 621, 729, 1863, 5589, 16767
Divisor Pairs of 16767
Each pair multiplies to 16767:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 16767 | = | 16767 |
| 3 | × | 5589 | = | 16767 |
| 9 | × | 1863 | = | 16767 |
| 23 | × | 729 | = | 16767 |
| 27 | × | 621 | = | 16767 |
| 69 | × | 243 | = | 16767 |
| 81 | × | 207 | = | 16767 |
Number of Divisors
The number 16767 has 14 divisors, written as τ(16767) = 14 in number theory.
Sum of Divisors
σ(16767) = 1 + 3 + 9 + 23 + 27 + 69 + 81 + 207 + 243 + 621 + 729 + 1863 + 5589 + 16767 = 26232
Prime Factorization of 16767
Properties of 16767
- 16767 is composite.
- 16767 is not a perfect square.
- Number of divisors: 14.
- Sum of divisors: 26232.
Common Divisors with Another Number?
Looking for the divisors that 16767 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 16767
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √16767 ≈ 129.49. If i divides 16767, then both i and 16767/i are divisors.
- 1 divides 16767 (16767 ÷ 1 = 16767) → pair (1, 16767)
- 3 divides 16767 (16767 ÷ 3 = 5589) → pair (3, 5589)
- 9 divides 16767 (16767 ÷ 9 = 1863) → pair (9, 1863)
- 23 divides 16767 (16767 ÷ 23 = 729) → pair (23, 729)
- 27 divides 16767 (16767 ÷ 27 = 621) → pair (27, 621)
- 69 divides 16767 (16767 ÷ 69 = 243) → pair (69, 243)
- 81 divides 16767 (16767 ÷ 81 = 207) → pair (81, 207)
- Collect all unique values: {1, 3, 9, 23, 27, 69, 81, 207, 243, 621, 729, 1863, 5589, 16767} — total 14 divisors.
- Sum: 1 + 3 + 9 + 23 + 27 + 69 + 81 + 207 + 243 + 621 + 729 + 1863 + 5589 + 16767 = 26232.
Nearby Examples
Related Operations for 16767
- Multiples of a Number — "outward" complement of divisors
- 16767 Prime Factorization — decompose into prime building blocks
- Find GCF of 16767 and another number
- Find LCM of 16767 and another number
- Is 16767 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