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