Divisors of 847: All 6 Factors

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 847

The number 847 has 6 divisors:

1,  7,  11,  77,  121,  847

Divisor Pairs of 847

Each pair multiplies to 847:

Number of Divisors

The number 847 has 6 divisors, written as τ(847) = 6 in number theory.

Sum of Divisors

σ(847) = 1 + 7 + 11 + 77 + 121 + 847 = 1064

Prime Factorization of 847

See the full prime factorization calculator →

Properties of 847

• 847 is composite.
• 847 is not a perfect square.
• Number of divisors: 6.
• Sum of divisors: 1064.

Common Divisors with Another Number?

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

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

1. 1 divides 847 (847 ÷ 1 = 847) → pair (1, 847)
2. 7 divides 847 (847 ÷ 7 = 121) → pair (7, 121)
3. 11 divides 847 (847 ÷ 11 = 77) → pair (11, 77)
4. Collect all unique values: {1, 7, 11, 77, 121, 847} — total 6 divisors.
5. Sum: 1 + 7 + 11 + 77 + 121 + 847 = 1064.

Nearby Examples

Related Operations for 847

• Multiples of 847 — "outward" complement; M is a multiple of 847 ⇔ 847 is a divisor of M
• 847 Prime Factorization — decompose into prime building blocks
• Find GCF of 847 and another number
• Find LCM of 847 and another number
• Is 847 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: