Divisor Calculator

Calculate all divisors, proper divisors, divisor count, divisor sum, factor pairs, and prime factorization from an integer. Divisor Calculator helps students, educators, programmers, and number theory enthusiasts analyze factors efficiently.

Highlights

  • Finds all positive and proper divisors of any integer.
  • Calculates divisor counts and sums instantly.
  • Displays factor pairs for easy factor analysis.
  • Provides the complete prime factorization.
  • Identifies the smallest prime and largest proper divisor.

Table of Contents

  1. How Divisor Calculator Works?
  2. Practical Use Cases
  3. Accuracy and Limitations
  4. Quick Examples
  5. Frequently Asked Questions (FAQs)
  6. Cite This Calculator

How Divisor Calculator Works?

The Divisor Calculator analyzes a positive integer n by identifying every positive number that divides it without a remainder. It first uses the prime factorization of the number, written as:

n=p1a1p2a2⋯pkak

Here, each p is a distinct prime number and each a is its exponent. Every divisor can be formed by choosing an exponent from 0 through ai for each prime factor.

The main calculations are:


OutputMathematical rule
Number of divisorsτ(n)=∏i=1k(ai+1)
Sum of divisorsσ(n)=∏i=1kpiai+1−1pi−1
Proper divisor countτ(n)−1, excluding n
Proper divisor sumσ(n)−n

Factor pairs are generated as (d, n/d) for each divisor d up to the square root of n. The smallest prime factor is the first prime dividing n. For any integer greater than 1, the largest proper divisor is nsmallest prime factor. For example, 120 has prime factorization 23 × 3 × 5, so it has (3 + 1)(1 + 1)(1 + 1) = 16 positive divisors, a divisor sum of 360, and 15 proper divisors.

Practical Use Cases

Students: Use the calculator to list divisors, verify factor pairs, practice prime factorization, and check answers involving divisor counts or sums.

Educators: Generate quick examples for lessons on factors, multiples, prime decomposition, perfect numbers, abundant numbers, and the relationship between a number and its proper divisors.

Programmers: Use the results to test routines for divisor enumeration, factor-pair generation, primality-related logic, and integer algorithms that depend on exact factor information.

Number theory enthusiasts: Examine divisor functions, compare proper divisor sums, identify highly factorable numbers, and explore classifications such as deficient, perfect, and abundant integers.

Accuracy and Limitations

The calculator uses exact integer arithmetic for positive whole numbers from 1 through 1,000,000,000,000, so divisor lists, counts, sums, factor pairs, and prime factorizations are mathematically exact for accepted inputs. It does not accept zero, negative numbers, fractions, or non-integer values. The number 1 is a special case: its only positive divisor is 1, it has no proper divisors, and it has no prime factorization or smallest prime factor; consequently, a largest proper divisor does not exist. Very large inputs near the upper limit may require more computation to factor than smaller inputs.

Quick Examples

Example #1: Highly Composite Number

Analyze the divisors and factorization of 120, a composite number with many factors.

Example #2: Prime Number Analysis

Examine the divisor properties of 97, a prime number with only two positive divisors.

Example #3: Perfect Number Check

Analyze 28 to identify its divisors and verify its perfect-number properties.

Frequently Asked Questions

A divisor is a positive integer that divides another integer evenly, leaving no remainder. For example, 3 is a divisor of 12 because 12 ÷ 3 = 4.

Proper divisors are the positive divisors of a number excluding the number itself. For 12, the proper divisors are 1, 2, 3, 4, and 6.

First write the number as a prime factorization. If the exponents are a, b, and so on, the total number of positive divisors is found by multiplying (a + 1)(b + 1) and the corresponding factors.

Prime factorization expresses an integer as a product of prime numbers. For example, 60 can be written as 2² × 3 × 5.

The sum of divisors includes the number itself, while the sum of proper divisors excludes it. This distinction is used to identify perfect, abundant, and deficient numbers.

Cite This Calculator