1. Factor Calculator: Find Every Factor and Understand the Number
A factor calculator finds the positive integers that divide a given number exactly, with no remainder. For a number n, a positive integer d is a factor of n when n ÷ d is an integer, or equivalently when n mod d = 0.
For example, the factors of 120 are:
So 120 has 16 positive factors.
But finding the factors is only part of the number-theory picture. The same factorization can be used to determine the prime factorization, number of divisors, sum of divisors, sum of proper divisors, factor pairs, and whether the number is prime, composite, perfect, abundant, deficient, or square-free.
This calculator brings those related results together instead of forcing you to perform each calculation separately. It also includes a common-factor finder and a quadratic trinomial factoring tool for algebraic expressions.
A useful principle is that factors come in pairs:
Whenever a divides n, the corresponding value b = n / a is also a factor. That is why factor pairs provide an efficient way to search for every divisor.
2. What Is a Factor?
A factor is an integer that divides another integer exactly.
For example:
Therefore, both 3 and 40 are factors of 120. Similarly, 8 × 15 = 120, so 8 and 15 are also factors.
For positive integers, the smallest positive factor is always 1 and the largest positive factor is the number itself:
A number can therefore be described through its factors rather than only through its decimal representation.
Factors vs. Multiples
These terms are often confused. A factor divides a number (for example, 4 | 20). A multiple is produced by multiplying a number by an integer: 20, 40, 60, 80... are multiples of 20.
Factors generally form a finite set for a positive integer, while a positive integer has infinitely many positive multiples.
3. How to Find All Factors of a Number
The simplest method is trial division: test integers and retain the ones that divide the target exactly.
For a number n, it is unnecessary to test every integer through n. Factors occur in pairs around √n, so checking candidates through ⌊√n⌋ is enough to discover the complete positive factor set.
Example: Factors of 36
Since √36 = 6, we test integers 1 through 6:
Therefore, the complete positive factors of 36 are: 1, 2, 3, 4, 6, 9, 12, 18, 36.
The factor pair 6 × 6 is special because the two members of the pair are identical. This is why a perfect square always has an odd number of positive divisors. The calculator automatically performs this process and presents the factors in ascending order.
4. Factor Pairs and Why They Matter
A factor pair consists of two integers whose product equals the target number.
For 120, the positive factor pairs are:
| Factor | Partner | Product Check |
|---|---|---|
| 1 | 120 | 1 × 120 = 120 |
| 2 | 60 | 2 × 60 = 120 |
| 3 | 40 | 3 × 40 = 120 |
| 4 | 30 | 4 × 30 = 120 |
| 5 | 24 | 5 × 24 = 120 |
| 6 | 20 | 6 × 20 = 120 |
| 8 | 15 | 8 × 15 = 120 |
| 10 | 12 | 10 × 12 = 120 |
The calculator also exposes the corresponding negative factor pairs:
The magnitude of the positive divisors remains unchanged. Factor pairs are useful because they give an immediate verification mechanism. If every small divisor has its corresponding partner, you can systematically account for the complete factor set.
5. Prime Factorization: Breaking a Number Into Its Building Blocks
A prime factorization expresses a positive integer as a product of prime numbers. For 120:
Prime factorization is useful because prime numbers are the basic multiplicative building blocks of positive integers. Once the prime powers are known, many other properties of the number can be calculated directly.
Example: for 60, 60 = 2 × 2 × 3 × 5, so 60 = 2² × 3 × 5.
The exponents also reveal information about the divisor structure of the number. For n = 120, 120 = 2³ × 3¹ × 5¹, so its exponent pattern is (3, 1, 1). That pattern is enough to determine the number of positive divisors.
6. Number of Factors: The Divisor-Count Formula
Suppose a positive integer has prime factorization n = p₁a₁ · p₂a₂ ··· pkak. Then the number of positive divisors is:
This works because a divisor can independently choose an exponent from 0 through ai for every prime pi.
Example for 120: We have 120 = 2³ × 3¹ × 5¹. Therefore:
So 120 has exactly 16 positive divisors. Instead of manually counting every divisor, the exponent structure gives the answer immediately. The divisor-function identity is standard number theory; d(n), also written τ(n), counts the positive divisors of n.
7. Sum of Divisors and Proper Divisors
The calculator also evaluates the sum of all positive divisors. This function is commonly written as σ(n). If n = p₁a₁ ··· pkak, then:
For 120 (where 120 = 2³ × 3 × 5):
The aliquot sum, or sum of the proper divisors, excludes the number itself:
Therefore, for 120: s(120) = 360 - 120 = 240. The divisor-sum and restricted-divisor functions are standard arithmetic functions in number theory.
8. Prime, Composite, Perfect, Abundant, and Deficient Numbers
Knowing the factors of a number lets you classify it systematically:
Prime Number
A prime number greater than 1 has exactly two positive divisors: 1 and p. For example, 997 has only 1 and 997 as positive divisors, so 997 is prime.
Composite Number
A composite number greater than 1 has more than two positive divisors. For example, 120 has 16 positive divisors, so it is composite.
The Special Case of 1
The number 1 has exactly one positive divisor, itself. Therefore, 1 is neither prime nor composite.
Perfect Number
A positive integer is perfect when the sum of its proper divisors equals the number itself. For 6: 1 + 2 + 3 = 6, so 6 is a perfect number.
Abundant Number
A number is abundant when the sum of its proper divisors is greater than the number. For 12: 1 + 2 + 3 + 4 + 6 = 16, and 16 > 12, so 12 is abundant.
Deficient Number
A number is deficient when the sum of its proper divisors is less than the number. For 8: 1 + 2 + 4 = 7, and 7 < 8, so 8 is deficient.
9. Square-Free Numbers and Prime Exponents
A number is square-free when no prime square divides it. Equivalently, in its prime factorization, every prime exponent is at most 1.
For example:
By contrast, 120 = 2³ × 3 × 5 contains repeated powers of 2 (specifically 2² = 4 divides 120), so 120 is not square-free. This property becomes particularly easy to see after prime factorization because the exponents expose repeated prime powers directly.
10. Finding Common Factors of Several Numbers
Sometimes the goal is not to factor one number but to determine the factors shared by several numbers. For example, 24, 36, and 60 have the common factors:
The distinction matters:
- Common factors: the complete set of factors shared by the numbers.
- Greatest Common Factor (GCF): the largest factor shared by all of them. To compute this directly for any number of inputs with Euclidean steps, explore our dedicated Greatest Common Factor (GCF) Calculator.
Prime factorization gives another way to understand the GCF. Shared primes are taken with the smallest exponent appearing across all numbers. For 36, 54, and 90:
11. Factor Trees: A Visual Way to Prime-Factor a Number
A factor tree repeatedly splits a composite number into smaller factors until every terminal value is prime. For 120, one possible decomposition is:
Different factor trees can have different intermediate branches, but when the process is completed, the prime factorization is the same apart from ordering. This is a practical demonstration of the Fundamental Theorem of Arithmetic. The interactive factor-tree visualization in this tool allows you to inspect each level dynamically.
12. Divisibility Rules as a Quick Factor Check
Divisibility rules can quickly identify common factors before doing complete factorization:
- Divisible by 2: The last digit is even (0, 2, 4, 6, 8).
- Divisible by 3: The sum of the digits is divisible by 3. For 120: 1 + 2 + 0 = 3, which is divisible by 3.
- Divisible by 5: The last digit is 0 or 5.
- Divisible by 10: The last digit is 0.
These quick checks are useful for mental arithmetic, while complete factorization provides the full mathematical structure. The calculator's Divisibility Rules tab checks all standard tests automatically with step-by-step reasoning.
13. How Prime Factorization Connects to the Number of Factors
There is a deeper combinatorial connection between prime exponents and divisors. Suppose n = 2a · 3b. A divisor of n can contain 2 raised to any power from 0 through a (which is a + 1 choices) and 3 raised to any power from 0 through b (which is b + 1 choices). The total number of positive divisors is therefore:
For example, 72 = 2³ × 3², so d(72) = (3 + 1)(2 + 1) = 4 × 3 = 12 positive divisors.
This also explains why a positive integer has an odd number of divisors exactly when it is a perfect square: all non-square divisors occur in distinct pairs d and n / d, whereas a square has one unpaired divisor at √n.
14. Factoring Quadratic Trinomials
Factorization is not limited to integers; algebraic polynomials can also be factored. A quadratic trinomial has the general form ax² + bx + c. When the expression factors over the integers or rationals, the goal is to rewrite it as a product of simpler binomials.
Example: x² - 5x + 6
We need two numbers whose product is 6 and whose sum is -5: (-2) × (-3) = 6 and (-2) + (-3) = -5. Therefore:
To verify the factorization, multiply the binomials back together: (x - 2)(x - 3) = x² - 3x - 2x + 6 = x² - 5x + 6. The original expression is recovered exactly.
15. What Happens When the Leading Coefficient Is Zero?
A true quadratic equation requires a nonzero x² coefficient. If a = 0, then ax² + bx + c becomes bx + c, which is a linear expression, not a quadratic.
For example, 0x² + 5x + 6 = 0 reduces to 5x + 6 = 0, giving the single linear root:
Treating that expression as an ordinary quadratic would introduce division by zero (2a = 0) into the quadratic formula. The calculator explicitly handles this case instead of returning meaningless values such as NaN or Infinity.
16. Worked Example: Complete Analysis of 120
Let's combine all the mathematical concepts for the primary reference integer, 120:
17. How to Use the Factor Calculator
Enter a positive integer into the main factor input. The calculator immediately returns the relevant factor information, including the complete positive factor list, factor pairs, canonical prime factorization, divisor statistics, and number classification.
You can also switch tabs to inspect the interactive binary factor tree or step-by-step divisibility rules. Use the multi-number module when you need shared common factors and GCF, or the quadratic trinomial module when factoring second-degree polynomials. Export tools allow you to copy summaries, copy LaTeX formulas, or download complete CSV records with one click.
18. Why Use a Factor Calculator Instead of Factoring by Hand?
Manual factorization is valuable for learning, but it becomes tedious when a number has many divisors or when several related quantities must be calculated. Analyzing 120 by hand requires finding 16 divisors, 8 positive factor pairs, the prime factorization, divisor count, divisor sum, aliquot sum, and number classification.
A calculator reduces repetitive arithmetic while preserving mathematical structure. It serves students checking homework, teachers designing problems, tutors demonstrating exponent properties, programmers validating number-theory algorithms, and engineers analyzing periodicities.
19. Common Mistakes When Finding Factors
- Mistake 1 (Forgetting 1): 1 divides every positive integer, so 1 is always a positive factor.
- Mistake 2 (Forgetting the number itself): Every positive integer divides itself, so n is always a positive factor of n.
- Mistake 3 (Counting a square-root factor twice): For a perfect square like 36 (6 × 6 = 36), 6 should appear only once in the sorted factor list.
- Mistake 4 (Confusing prime factorization with the full factor list): For 60 = 2² × 3 × 5, the right side is the prime decomposition, not the list of all 12 divisors.
- Mistake 5 (Assuming every integer has two or more factors): The number 1 is a unit with exactly one positive divisor.
- Mistake 6 (Treating 0 like an ordinary factoring target): Zero has infinitely many divisors because every nonzero integer divides 0. The calculator explicitly rejects 0 with a guidance banner.
20. Factors, GCF, and LCM: How the Ideas Fit Together
Factorization becomes especially useful when comparing numbers. The GCF is found from prime factors common to all numbers (using the smallest exponent), while the LCM uses every prime needed (using the largest exponent).
For any two positive integers a and b, their product equals the product of their greatest common factor and least common multiple:
For example, for 48 and 60: 48 = 2⁴ × 3 and 60 = 2² × 3 × 5. We find GCF(48, 60) = 2² × 3 = 12 and LCM(48, 60) = 2⁴ × 3 × 5 = 240. Checking the identity: 12 × 240 = 2,880 and 48 × 60 = 2,880. For multi-number multiples and steps, explore our Least Common Multiple (LCM) Calculator.
Frequently Asked Questions
What is a factor calculator?
A factor calculator finds the positive integers that divide a given positive integer exactly. It also displays factor pairs, prime factorization, divisor count, divisor sums, and number classifications.
How do I find all the factors of a number?
Test candidate divisors and keep the values that divide the number with no remainder. An efficient approach checks candidates only through √n, because each divisor below the square root has a matching partner above it.
What are the factors of 120?
The 16 positive factors of 120 are: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, and 120.
What is the prime factorization of 120?
The canonical prime factorization is 120 = 2³ × 3 × 5. This expresses 120 as the product of three 2s, one 3, and one 5.
How many factors does 120 have?
120 has 16 positive factors. From its prime factorization 120 = 2³ × 3¹ × 5¹, the divisor-count formula gives (3 + 1)(1 + 1)(1 + 1) = 4 × 2 × 2 = 16.
Is 1 a prime number?
No. The number 1 has exactly one positive factor (itself), while a prime number is defined as having exactly two distinct positive factors: 1 and itself.
What is the difference between factors and multiples?
Factors divide a number exactly (e.g., 3 is a factor of 12). Multiples are produced by multiplying a number by integers (e.g., 12, 24, 36, and 48 are multiples of 12).
What is a factor pair?
A factor pair consists of two numbers whose product equals the target number. For 24, factor pairs include 1 × 24, 2 × 12, 3 × 8, and 4 × 6.
Why does a perfect square have an odd number of factors?
Most factors occur in distinct pairs d and n / d. For a perfect square, √n pairs with itself, so one divisor is unpaired, making the total divisor count odd.
What is the difference between a factor and a prime factor?
A factor can be any divisor of a number. A prime factor is specifically a factor that is a prime number. For 60, factors include 4, 6, and 10, but its prime factors are only 2, 3, and 5.
What is the divisor-count formula?
If n = p₁a₁ · p₂a₂ ··· pkak, then d(n) = (a₁ + 1)(a₂ + 1) ··· (ak + 1). It gives the exact number of positive divisors.
What is the sum-of-divisors formula?
For the same prime factorization, σ(n) = ∏ [(piai + 1 - 1) / (pi - 1)]. It evaluates the sum of all positive divisors.
What is an aliquot sum?
The aliquot sum is the sum of the proper divisors (all positive divisors excluding the number itself): s(n) = σ(n) - n. For 120, s(120) = 360 - 120 = 240.
What makes a number perfect?
A positive integer is perfect when its proper divisors add up exactly to the number itself. The smallest example is 6 (1 + 2 + 3 = 6).
What makes a number abundant?
A number is abundant when the sum of its proper divisors is greater than the number. For 12, 1 + 2 + 3 + 4 + 6 = 16 > 12.
What makes a number deficient?
A number is deficient when the sum of its proper divisors is less than the number. For 8, 1 + 2 + 4 = 7 < 8.
What is a square-free number?
A square-free number has no repeated prime factor in its canonical prime factorization. For example, 30 = 2 × 3 × 5 is square-free, while 36 = 2² × 3² is not.
Can the calculator find common factors of multiple numbers?
Yes. Enter two or more integers in the Multi-Number Inputs module to obtain the shared factor intersection and the greatest common factor.
What is the difference between common factors and the GCF?
Common factors are every divisor shared by all input numbers. The GCF is the single largest number in that shared set. For 24, 36, and 60, common factors are 1, 2, 3, 4, 6, 12, and the GCF is 12.
Can this calculator factor quadratic expressions?
Yes. The quadratic module accepts coefficients a, b, and c for ax² + bx + c and returns factored binomial forms and roots. If a = 0, it detects the linear equation bx + c = 0 without division by zero.
More Than a Simple Factor Finder
Factoring is one of the foundations of elementary and intermediate number theory. Once a number is expressed through its divisors and prime factors, many apparently different calculations become connected:
It also provides the foundation for finding common factors, greatest common factors, least common multiples, simplifying fractions with our Fraction Calculator, and understanding algebraic expressions.
For quadratic expressions, the same general idea applies: replace a complicated expression with a product of simpler factors, then verify the result by multiplication. The goal of this calculator is to make the mathematical structure behind factorization visible so that every answer can be checked, explained, and reused with confidence.