Factor Calculator

What is a factor calculator?

A factor calculator finds every positive whole number that divides the input evenly. It can list all factors, group them into factor pairs that multiply to the input, return the prime factorization, or compute the greatest common factor of two numbers. Each mode handles the same question from a slightly different angle.

How the factor calculator works

Pick a mode and enter a whole number:

• Factors of a number: loops from 1 up to √n and collects every divisor in both directions.
• Factor pairs: the same loop, but returns pairs (i, n/i) instead of a flat list.
• Prime factorization: trial division by 2, 3, 5, 7, 11, ... until the remaining value reaches 1.
• Greatest common factor: the Euclidean algorithm, with each remainder step shown for clarity.

Inputs are capped at one billion in absolute value to keep the calculator responsive. For everyday math class problems that range is more than enough.

Finding all factors of a number

The fastest hand method is to check divisors in pairs. Start from 1 and go up; for every divisor i you find, the quotient n / i is also a factor. Stop when you reach √n, because any factor beyond that point will already have been paired with one you already wrote down.

Example: factors of 36. Check 1, 2, 3, 4, 5, 6. Hits at 1, 2, 3, 4, 6, paired with 36, 18, 12, 9, 6. Combine and sort: 1, 2, 3, 4, 6, 9, 12, 18, 36 (the 6 pairs with itself).

Prime factorization

Prime factorization writes a whole number as a product of prime numbers. By the fundamental theorem of arithmetic, every integer greater than 1 has a unique prime factorization, ignoring the order. The calculator divides by the smallest prime as many times as possible, then moves on to the next prime, and continues until the remaining value is 1.

Example: prime factorization of 60. 60 / 2 = 30; 30 / 2 = 15; 15 / 3 = 5; 5 / 5 = 1. The list is 2, 2, 3, 5, grouped as 2^2 × 3 × 5.

For a prime input, the prime factorization is just the number itself. The calculator flags this case.

Factor pairs

Factor pairs are pairs of whole numbers that multiply to the input. They are useful for finding rectangle dimensions with a given area, for building factor trees, and for factoring quadratic expressions. The calculator lists every positive pair from smallest first factor to largest.

Example: factor pairs of 24. 1 × 24, 2 × 12, 3 × 8, 4 × 6. Four pairs, eight factors total.

Greatest common factor

The greatest common factor (GCF) of two whole numbers is the largest whole number that divides both. It is also called the greatest common divisor (GCD). The Euclidean algorithm finds the GCF quickly: divide the larger by the smaller, take the remainder, and repeat with the divisor and the remainder until the remainder is 0. The last nonzero remainder is the GCF.

Example: gcf(48, 60). 60 = 1 × 48 + 12, 48 = 4 × 12 + 0. The remainder is 0, so the GCF is 12. The calculator prints each step in the side panel so you can follow along.

Another way to find the GCF is to list the factors of both numbers and pick the largest one that appears in both lists. The Euclidean approach is faster and produces the same result.

Special cases

• 0: every nonzero integer divides 0, so 0 has infinitely many factors. The calculator shows a message rather than an empty list.
• 1: the only positive factor is 1 itself; 1 has no prime factorization (it is neither prime nor composite).
• Prime numbers: the only positive factors are 1 and the number itself; the prime factorization is the number alone.
• Negative inputs: factors are computed on the absolute value. Every positive factor f of |n| also has a negative counterpart -f, so a negative input has twice as many integer factors as the positive count.
• gcf(0, 0): undefined, since every integer divides 0 and there is no greatest one.

Worked examples

• Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60 (12 factors).
• Factor pairs of 60: 1 × 60, 2 × 30, 3 × 20, 4 × 15, 5 × 12, 6 × 10 (6 pairs).
• Prime factorization of 60: 2^2 × 3 × 5.
• gcf(48, 60): 12.
• Factors of 17: 1, 17 (17 is prime).
• Prime factorization of 360: 2^3 × 3^2 × 5.

Common mistakes

• Forgetting that 1 and the number itself are always factors of any positive integer.
• Stopping the divisor loop too early. Every factor up to √n has a partner above it; both belong in the full factor list.
• Calling 1 prime. By the standard convention, 1 is neither prime nor composite.
• Confusing the greatest common factor with the least common multiple. The GCF divides both numbers; the LCM is divisible by both.
• Ignoring negative counterparts when the integer factors of a negative input are needed.

Where factors show up

Factors are foundational across math. They show up in fraction simplification (divide top and bottom by the GCF), in factoring polynomials, in finding rectangle dimensions with a given area, in modular arithmetic and cryptography, and in any problem that asks how a whole quantity can be split evenly. They also underpin powers and roots: a prime factorization is the cleanest way to spot whether a number is a perfect square, a perfect cube, or some other perfect power.

For related operations, see the square root calculator for the simplified radical form (which depends on the prime factorization), and the exponent calculator for raising values to powers.

Related tools

• Scientific calculator for a full button-driven calculator with logs, exponents, roots, and trig in one place.
• Square root calculator with simplified radical form.
• Exponent calculator for raising a base to a power.
• Quadratic formula calculator for solving ax² + bx + c = 0.
• Percentage calculator for the three standard percent questions.
• All education calculators.