Factor Calculator

Complete Factor Calculator Guide & Information

1. What is a Factor?

A factor of a positive integer n, also called a divisor, is a positive integer that divides n without leaving a remainder. If a × b = n, then a and b are factors of n. Every integer has at least two factors: 1 and itself.

Factors come in pairs. For each factor a that divides n, there is a corresponding factor b = n/a such that a × b = n. These are called factor pairs.

2. Types of Numbers by Factor Count

• Prime number: Exactly two distinct factors: 1 and itself. Examples: 2, 3, 5, 7, 11, 13.
• Composite number: More than two distinct factors. Examples: 4, 6, 8, 9, 10, 12.
• Unit (1): Exactly one factor (itself). Neither prime nor composite.
• Perfect square: Has an odd number of factors because one factor is repeated (the square root).
• Highly composite: Has more divisors than any smaller positive integer.

3. How to Find All Factors

The standard method is trial division up to the square root of n:

1. Start with i = 1.
2. If n is divisible by i, add i and n/i to the factor list.
3. Increment i by 1.
4. Stop when i > √n.
5. Sort the list of factors in ascending order.

This is efficient because factors above √n are simply the complements of factors below √n.

4. Prime Factorization

Prime factorization is the process of writing a number as the product of its prime factors. Every positive integer has a unique prime factorization (Fundamental Theorem of Arithmetic).

For example, 120 = 2³ × 3¹ × 5¹.

5. Factor Tree Method

A factor tree is a visual diagram that shows the breakdown of a number into its prime factors through successive division. Each branch splits a composite number into two factors until all leaves are prime.

• Start with the target number at the top.
• Split it into any pair of factors.
• Continue splitting each composite number.
• Stop when all end nodes are prime numbers.
• Multiply all prime leaves to verify the original number.

6. Number of Divisors Formula

Given prime factorization n = p₁ᵏ¹ × p₂ᵏ² × ... × pₘᵏᵐ, the total number of positive divisors is:

Example: 120 = 2³ × 3¹ × 5¹ → d(120) = (3+1)(1+1)(1+1) = 4 × 2 × 2 = 16 factors.

7. Sum of Divisors Formula

The sum of all positive divisors, denoted σ(n), is:

8. Input & Control Definitions

• Number input: Enter any positive integer (whole number) to factorize.
• Calculate Button: Computes all factors, factor pairs, prime factorization, and factor tree, then updates the distribution chart.
• Clear Button: Clears the input field completely.
• Factors: Complete comma-separated list of all positive divisors in ascending order.
• Factor Pairs: All pairs (a, b) such that a × b equals the input number.
• Prime factors: Full expanded prime factorization in multiplication form.
• Factor Tree: Text-based tree diagram showing successive factorization.
• Factor Size Distribution chart: Bar chart visualizing the magnitude of each factor.

9. Worked Examples

Example 1 — Number 12:

• Factors: 1, 2, 3, 4, 6, 12
• Factor pairs: (1,12) (2,6) (3,4)
• Prime factorization: 12 = 2 × 2 × 3 = 2² × 3
• Number of factors: (2+1)(1+1) = 6

Example 2 — Prime number 17:

• Factors: 1, 17
• Factor pairs: (1, 17)
• Prime factorization: 17 (already prime)
• Number of factors: 2

Example 3 — Number 120 (default):

• 16 factors total
• 8 factor pairs
• Prime factorization: 2³ × 3 × 5
• Factor tree shows successive division by smallest prime factors

10. Real-World Applications

• Fraction simplification: GCF uses common factors to reduce fractions
• Algebra: Factoring polynomials and solving equations
• Number theory: Divisor function, perfect numbers, amicable numbers
• Cryptography: Integer factorization is basis of RSA security
• Arrangement problems: Rows, columns, grid layouts
• Multiples and LCM: Factor analysis underpins LCM calculations
• Computer science: Hash table sizing, algorithm analysis
• Engineering: Gear tooth counts, mechanical advantage

11. Common Factor Reference Table

Number	Factor List	Count	Prime Factorization
12	1, 2, 3, 4, 6, 12	6	2² × 3
18	1, 2, 3, 6, 9, 18	6	2 × 3²
24	1, 2, 3, 4, 6, 8, 12, 24	8	2³ × 3
36	1, 2, 3, 4, 6, 9, 12, 18, 36	9	2² × 3²
48	1, 2, 3, 4, 6, 8, 12, 16, 24, 48	10	2⁴ × 3
60	1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60	12	2² × 3 × 5
100	1, 2, 4, 5, 10, 20, 25, 50, 100	9	2² × 5²
120	1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120	16	2³ × 3 × 5

12. Important Notes

• Only positive factors are listed. Negative factors are simply the negatives of positive factors.
• Prime factorization is unique for every integer (Fundamental Theorem of Arithmetic).
• Factor trees are not unique — different splitting orders produce different tree shapes but the same prime factors.
• Very large numbers (above ~10¹²) may take longer to factorize by trial division.
• Numbers with large prime factors are the hardest to factorize; this is the basis of modern cryptography.

13. Related Mathematical Concepts

• Greatest Common Factor (GCF): Largest factor shared by two or more numbers
• Least Common Multiple (LCM): Smallest multiple shared by two or more numbers
• Prime number: Number with exactly two distinct positive divisors
• Divisor function: σ(n) — sum of all divisors
• Perfect number: σ(n) = 2n (sum of proper divisors equals the number)
• Sieve of Eratosthenes: Algorithm for finding all primes up to a limit
• Euler's totient function: Counts integers up to n that are coprime with n

14. References

1. Euclid. "Elements," Book VII–IX. Circa 300 BCE.
2. Gauss, Carl Friedrich. "Disquisitiones Arithmeticae." 1801.
3. Hardy, G. H. and Wright, E. M. "An Introduction to the Theory of Numbers." Oxford University Press. 2008.
4. Knuth, Donald E. "The Art of Computer Programming, Volume 2: Seminumerical Algorithms." Addison-Wesley. 1997.
5. Rosen, Kenneth H. "Elementary Number Theory and Its Applications." Pearson. 2010.
6. Burton, David M. "Elementary Number Theory." McGraw-Hill. 2010.
7. Crandall, Richard and Pomerance, Carl. "Prime Numbers: A Computational Perspective." Springer. 2005.