Divisors of 1966: All 4 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 1966

The number 1966 has 4 divisors:

1,  2,  983,  1966

Divisor Pairs of 1966

Each pair multiplies to 1966:

Number of Divisors

The number 1966 has 4 divisors, written as τ(1966) = 4 in number theory.

Sum of Divisors

σ(1966) = 1 + 2 + 983 + 1966 = 2952

Prime Factorization of 1966

See the full prime factorization calculator →

Properties of 1966

• 1966 is composite.
• 1966 is not a perfect square.
• Number of divisors: 4.
• Sum of divisors: 2952.

Common Divisors with Another Number?

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

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

1. 1 divides 1966 (1966 ÷ 1 = 1966) → pair (1, 1966)
2. 2 divides 1966 (1966 ÷ 2 = 983) → pair (2, 983)
3. Collect all unique values: {1, 2, 983, 1966} — total 4 divisors.
4. Sum: 1 + 2 + 983 + 1966 = 2952.

Nearby Examples

Related Operations for 1966

• Multiples of 1966 — "outward" complement; M is a multiple of 1966 ⇔ 1966 is a divisor of M
• 1966 Prime Factorization — decompose into prime building blocks
• Find GCF of 1966 and another number
• Find LCM of 1966 and another number
• Is 1966 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: