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