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