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