Divisors of 9750: All 32 Factors
Quick Answer
9750 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 13, 15, 25, 26, 30, 39, 50, 65, 75, 78, 125, 130, 150, 195, 250, 325, 375, 390, 650, 750, 975, 1625, 1950, 3250, 4875, 9750.
Sum: 26208.
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 9750
The number 9750 has 32 divisors:
1, 2, 3, 5, 6, 10, 13, 15, 25, 26, 30, 39, 50, 65, 75, 78, 125, 130, 150, 195, 250, 325, 375, 390, 650, 750, 975, 1625, 1950, 3250, 4875, 9750
Divisor Pairs of 9750
Each pair multiplies to 9750:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 9750 | = | 9750 |
| 2 | × | 4875 | = | 9750 |
| 3 | × | 3250 | = | 9750 |
| 5 | × | 1950 | = | 9750 |
| 6 | × | 1625 | = | 9750 |
| 10 | × | 975 | = | 9750 |
| 13 | × | 750 | = | 9750 |
| 15 | × | 650 | = | 9750 |
| 25 | × | 390 | = | 9750 |
| 26 | × | 375 | = | 9750 |
| 30 | × | 325 | = | 9750 |
| 39 | × | 250 | = | 9750 |
| 50 | × | 195 | = | 9750 |
| 65 | × | 150 | = | 9750 |
| 75 | × | 130 | = | 9750 |
| 78 | × | 125 | = | 9750 |
Number of Divisors
The number 9750 has 32 divisors, written as τ(9750) = 32 in number theory.
Sum of Divisors
σ(9750) = 1 + 2 + 3 + 5 + 6 + 10 + 13 + 15 + 25 + 26 + 30 + 39 + 50 + 65 + 75 + 78 + 125 + 130 + 150 + 195 + 250 + 325 + 375 + 390 + 650 + 750 + 975 + 1625 + 1950 + 3250 + 4875 + 9750 = 26208
Prime Factorization of 9750
Properties of 9750
- 9750 is composite.
- 9750 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 26208.
Common Divisors with Another Number?
Looking for the divisors that 9750 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 9750
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √9750 ≈ 98.74. If i divides 9750, then both i and 9750/i are divisors.
- 1 divides 9750 (9750 ÷ 1 = 9750) → pair (1, 9750)
- 2 divides 9750 (9750 ÷ 2 = 4875) → pair (2, 4875)
- 3 divides 9750 (9750 ÷ 3 = 3250) → pair (3, 3250)
- 5 divides 9750 (9750 ÷ 5 = 1950) → pair (5, 1950)
- 6 divides 9750 (9750 ÷ 6 = 1625) → pair (6, 1625)
- 10 divides 9750 (9750 ÷ 10 = 975) → pair (10, 975)
- 13 divides 9750 (9750 ÷ 13 = 750) → pair (13, 750)
- 15 divides 9750 (9750 ÷ 15 = 650) → pair (15, 650)
- 25 divides 9750 (9750 ÷ 25 = 390) → pair (25, 390)
- 26 divides 9750 (9750 ÷ 26 = 375) → pair (26, 375)
- 30 divides 9750 (9750 ÷ 30 = 325) → pair (30, 325)
- 39 divides 9750 (9750 ÷ 39 = 250) → pair (39, 250)
- 50 divides 9750 (9750 ÷ 50 = 195) → pair (50, 195)
- 65 divides 9750 (9750 ÷ 65 = 150) → pair (65, 150)
- 75 divides 9750 (9750 ÷ 75 = 130) → pair (75, 130)
- 78 divides 9750 (9750 ÷ 78 = 125) → pair (78, 125)
- Collect all unique values: {1, 2, 3, 5, 6, 10, 13, 15, 25, 26, 30, 39, 50, 65, 75, 78, 125, 130, 150, 195, 250, 325, 375, 390, 650, 750, 975, 1625, 1950, 3250, 4875, 9750} — total 32 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 10 + 13 + 15 + 25 + 26 + 30 + 39 + 50 + 65 + 75 + 78 + 125 + 130 + 150 + 195 + 250 + 325 + 375 + 390 + 650 + 750 + 975 + 1625 + 1950 + 3250 + 4875 + 9750 = 26208.
Nearby Examples
Related Operations for 9750
- Multiples of 9750 — "outward" complement; M is a multiple of 9750 ⇔ 9750 is a divisor of M
- 9750 Prime Factorization — decompose into prime building blocks
- Find GCF of 9750 and another number
- Find LCM of 9750 and another number
- Is 9750 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