Divisors of 9947: All 8 Factors

Quick Answer

9947 has 8 divisors (factors): 1, 7, 29, 49, 203, 343, 1421, 9947.

Sum: 12000.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 7, 29, 49, 203, 343, 1421, 9947

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 9947

The number 9947 has 8 divisors:

1,  7,  29,  49,  203,  343,  1421,  9947

Divisor Pairs of 9947

Each pair multiplies to 9947:

Factor 1×Factor 2=Product
1×9947=9947
7×1421=9947
29×343=9947
49×203=9947

Number of Divisors

The number 9947 has 8 divisors, written as τ(9947) = 8 in number theory.

Sum of Divisors

σ(9947) = 1 + 7 + 29 + 49 + 203 + 343 + 1421 + 9947 = 12000

Properties of 9947

  • 9947 is composite.
  • 9947 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 12000.

Common Divisors with Another Number?

Looking for the divisors that 9947 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 9947

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √9947 ≈ 99.73. If i divides 9947, then both i and 9947/i are divisors.

  1. 1 divides 9947 (9947 ÷ 1 = 9947) → pair (1, 9947)
  2. 7 divides 9947 (9947 ÷ 7 = 1421) → pair (7, 1421)
  3. 29 divides 9947 (9947 ÷ 29 = 343) → pair (29, 343)
  4. 49 divides 9947 (9947 ÷ 49 = 203) → pair (49, 203)
  5. Collect all unique values: {1, 7, 29, 49, 203, 343, 1421, 9947} — total 8 divisors.
  6. Sum: 1 + 7 + 29 + 49 + 203 + 343 + 1421 + 9947 = 12000.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 9947

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