Divisors of 1664: All 16 Factors
Quick Answer
1664 has 16 divisors (factors): 1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 104, 128, 208, 416, 832, 1664.
Sum: 3570.
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 1664
The number 1664 has 16 divisors:
1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 104, 128, 208, 416, 832, 1664
Divisor Pairs of 1664
Each pair multiplies to 1664:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 1664 | = | 1664 |
| 2 | × | 832 | = | 1664 |
| 4 | × | 416 | = | 1664 |
| 8 | × | 208 | = | 1664 |
| 13 | × | 128 | = | 1664 |
| 16 | × | 104 | = | 1664 |
| 26 | × | 64 | = | 1664 |
| 32 | × | 52 | = | 1664 |
Number of Divisors
The number 1664 has 16 divisors, written as τ(1664) = 16 in number theory.
Sum of Divisors
σ(1664) = 1 + 2 + 4 + 8 + 13 + 16 + 26 + 32 + 52 + 64 + 104 + 128 + 208 + 416 + 832 + 1664 = 3570
Prime Factorization of 1664
Properties of 1664
- 1664 is composite.
- 1664 is not a perfect square.
- Number of divisors: 16.
- Sum of divisors: 3570.
Common Divisors with Another Number?
Looking for the divisors that 1664 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 1664
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √1664 ≈ 40.79. If i divides 1664, then both i and 1664/i are divisors.
- 1 divides 1664 (1664 ÷ 1 = 1664) → pair (1, 1664)
- 2 divides 1664 (1664 ÷ 2 = 832) → pair (2, 832)
- 4 divides 1664 (1664 ÷ 4 = 416) → pair (4, 416)
- 8 divides 1664 (1664 ÷ 8 = 208) → pair (8, 208)
- 13 divides 1664 (1664 ÷ 13 = 128) → pair (13, 128)
- 16 divides 1664 (1664 ÷ 16 = 104) → pair (16, 104)
- 26 divides 1664 (1664 ÷ 26 = 64) → pair (26, 64)
- 32 divides 1664 (1664 ÷ 32 = 52) → pair (32, 52)
- Collect all unique values: {1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 104, 128, 208, 416, 832, 1664} — total 16 divisors.
- Sum: 1 + 2 + 4 + 8 + 13 + 16 + 26 + 32 + 52 + 64 + 104 + 128 + 208 + 416 + 832 + 1664 = 3570.
Nearby Examples
Related Operations for 1664
- Multiples of 1664 — "outward" complement; M is a multiple of 1664 ⇔ 1664 is a divisor of M
- 1664 Prime Factorization — decompose into prime building blocks
- Find GCF of 1664 and another number
- Find LCM of 1664 and another number
- Is 1664 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