What Is a Factoring Calculator
A factoring calculator rewrites a value as a product of simpler factors. For an integer, that means a unique product of prime numbers once the sign and factor order are ignored. For a quadratic polynomial, factoring means extracting any common coefficient and, when possible, rewriting the remaining expression as a product of two linear binomials.
Those tasks use different mathematics, so this page separates them into Integer and Quadratic polynomial modes. The result identifies the method, shows exact intermediate values, and includes an independent product or expansion check instead of presenting an unexplained factor string.
How to Use the Factoring Calculator
Choose Integer when the input is one whole number, including a negative integer, zero, or a unit such as 1. Choose Quadratic polynomial for an expression in the form ax^2 + bx + c with integer coefficients and a nonzero a. Enter the signs exactly as written; for example, x^2 - 5x + 6 uses a = 1, b = -5, and c = 6.
After selecting Factor, read the primary factorization first and then inspect the classification, exact checks, and table. Integer mode verifies the prime powers against the original magnitude. Quadratic mode multiplies the reported factors to reconstruct the x^2, x, and constant coefficients.
- Select Integer or Quadratic polynomial mode.
- Enter the integer, or enter the three signed coefficients a, b, and c.
- Select Factor and read the prime-power or binomial result.
- Review the divisor properties or discriminant and exact roots.
- Use the factor-pair or expansion table as an independent arithmetic check.
- Keep the original problem beside the result so signs and coefficients can be compared.
Prime Factorization and Integer Properties
The Fundamental Theorem of Arithmetic states that every integer with absolute value greater than 1 has one prime factorization apart from factor order. Repeated primes are grouped with exponents, so 360 = 2^3 x 3^2 x 5. A negative input adds the unit -1; the prime factors and divisor properties are calculated from its absolute value.
Zero, 1, and -1 need explicit boundary treatment. Zero has infinitely many integer divisors and no unique finite prime factorization. The values 1 and -1 are units rather than primes or composites, so they have no prime factors. The calculator reports these facts instead of forcing them into an ordinary composite-number result.
- Prime-power form groups repeated primes with exponents.
- Expanded form lists each prime occurrence separately.
- Factor pairs multiply to the absolute value of the input.
- A prime input has exactly two positive divisors: 1 and itself.
Integer factorization: |n| = p1^e1 x p2^e2 x ... x pk^ek
Read Divisor Count, Divisor Sum, Totient, and Radical
Prime exponents unlock several useful number properties without testing every possible divisor. The divisor-count function tau multiplies one more than each exponent. The divisor-sum function sigma multiplies a geometric-series total for each prime. Subtracting the original magnitude from sigma gives the sum of proper positive divisors.
Euler's totient phi counts positive integers up to n that are coprime to n. The radical multiplies each distinct prime once. Exponents also identify perfect squares and square-free numbers: every exponent is even for a square, while every exponent is one for a square-free value.
Positive divisor count: tau(n) = product of (ei + 1)Positive divisor sum: sigma(n) = product of (pi^(ei + 1) - 1) / (pi - 1)Euler totient: phi(n) = n x product of (1 - 1/pi)
| Property | Exact setup | Result | Meaning |
|---|---|---|---|
| Positive divisors | (3+1)(2+1)(1+1) | 24 | There are 24 positive divisors. |
| Euler totient | 360(1-1/2)(1-1/3)(1-1/5) | 96 | Ninety-six values from 1 through 360 are coprime to 360. |
| Radical | 2 x 3 x 5 | 30 | Each distinct prime appears once. |
| Square-free | Exponents 3, 2, 1 | No | At least one prime repeats. |
Factor an Integer-Coefficient Quadratic
Quadratic mode starts with the content, the greatest common factor of a, b, and c. The sign is chosen so the primitive polynomial has a positive leading coefficient. For 12x^2 + 10x + 2, the content is 2 and the primitive expression is 6x^2 + 5x + 1.
The primitive discriminant D = B^2 - 4AC determines rational factorability. If D is a nonnegative perfect square, both roots are rational and the primitive integer polynomial can be written as integer linear factors. If D is negative or a non-square positive integer, the primitive polynomial is irreducible over the integers even though irrational or complex roots may still exist.
- Extract the complete signed coefficient GCF first.
- Calculate the discriminant from the primitive coefficients.
- Build linear factors from reduced rational roots when sqrt(D) is an integer.
- Expand the factors to verify all three original coefficients.
Polynomial content: g = GCF(a, b, c), so ax^2 + bx + c = g(Ax^2 + Bx + C)Quadratic discriminant: D = B^2 - 4ACAn integer-coefficient quadratic factors into rational binomials exactly when D is a nonnegative perfect square
Recognize Factoring Patterns Without Guessing
A repeated factor occurs when D = 0, which corresponds to a perfect-square trinomial after the content GCF is removed. A polynomial with no x term and a negative constant may be a difference of squares. A zero constant exposes a common x factor. General factorable trinomials do not need to match a named visual pattern; the discriminant test still identifies exact rational roots.
Equivalent factorizations can look different. The factors may appear in reverse order, and a pair of negative signs can be moved between a scalar and the binomials without changing the product. Expansion is therefore a stronger check than comparing the text of two answers character for character.
Expansion check: (px + q)(rx + s) = prx^2 + (ps + qr)x + qs
| Expression | Pattern | Factored form | Verification clue |
|---|---|---|---|
| x^2 - 9 | Difference of squares | (x - 3)(x + 3) | Middle terms cancel. |
| x^2 + 6x + 9 | Perfect-square trinomial | (x + 3)^2 | D = 0 and one repeated root. |
| 6x^2 + 5x + 1 | General trinomial | (2x + 1)(3x + 1) | Outer and inner terms add to 5x. |
| 2x^2 + 2 | Irreducible over integers | 2(x^2 + 1) | The content factors out, but D is negative. |
Factoring Calculator Worked Examples
For integer input -84, separate the unit -1 and factor 84. The prime-power result is -1 x 2^2 x 3 x 7. Multiplying those factors returns -84, while the exponents produce 12 positive divisors for the magnitude.
For 6x^2 + 5x + 1, the coefficient GCF is 1 and D = 25 - 24 = 1. The roots are -1/2 and -1/3, so the exact integer factors are (2x + 1)(3x + 1). Expanding gives 6x^2 + 5x + 1.
| Input | Key step | Result | Independent check |
|---|---|---|---|
| 360 | Collect repeated primes | 2^3 x 3^2 x 5 | Prime powers multiply to 360. |
| -84 | Separate -1 | -1 x 2^2 x 3 x 7 | Product equals -84. |
| 6x^2 + 5x + 1 | D = 1 | (2x + 1)(3x + 1) | Expansion restores 6, 5, and 1. |
| x^2 + x + 1 | D = -3 | Irreducible over integers | No real or rational linear factors. |
Factoring Calculator Features
This calculator keeps integer number theory and quadratic algebra in one focused workspace without pretending they are the same operation. Every result is generated from exact integer arithmetic, and the primary answer is supported by classifications, formulas, and a table that can be audited independently.
- Prime factorization for positive and negative integers up to 15 digits.
- Explicit results for zero, 1, and -1.
- Prime powers, expanded factors, distinct primes, and factor pairs.
- Divisor count, divisor sum, proper-divisor classification, totient, and radical.
- Quadratic content GCF, discriminant, exact roots, and integer binomial factors.
- Irreducibility explanation for non-square or negative discriminants.
- Coefficient-by-coefficient expansion verification.
- Copyable results and downloadable result tables.
Benefits of Exact Factoring
Exact factors reveal structure that a decimal approximation can hide. Prime powers simplify fractions, GCF and LCM work, divisibility questions, and number-theory exercises. Quadratic factors expose zeros directly and can make equation solving, graph interpretation, and algebraic simplification easier.
The verification output is equally important. A plausible-looking pair of binomials may carry the wrong middle sign, and a prime list may omit a repeated factor. Multiplying back to the original value catches those mistakes without requiring trust in the calculator's headline answer.
Common Factoring Calculator Use Cases
Use Integer mode when the task concerns one exact whole number. Use Quadratic polynomial mode only for a second-degree expression with integer coefficients. Higher-degree, multivariable, fractional-coefficient, and symbolic expressions need a broader computer algebra system or a method tailored to the course.
- Find prime factors and factor pairs for arithmetic or homework.
- Calculate divisor count, divisor sum, totient, or radical from prime powers.
- Check whether an integer is prime, composite, square-free, or a perfect square.
- Factor out a coefficient GCF from a quadratic.
- Factor a trinomial into exact integer binomials.
- Identify a perfect-square trinomial or difference of squares.
- Explain why a quadratic is irreducible over the integers.
- Verify a hand-factored answer by expansion.
Accuracy, Scope, and Trust Notes
Integer inputs are parsed as digit strings and calculated with exact integer arithmetic rather than floating-point approximations. Quadratic coefficients must be integers from -1,000,000,000 through 1,000,000,000, a must be nonzero, and factorability is tested on the primitive polynomial after its signed content GCF is removed.
The quadratic result is limited to factors over the integers and rational numbers. An irreducible label is always relative to that domain; a polynomial may still have irrational or complex roots. The tool does not factor higher-degree polynomials, rational expressions, or expressions containing several variables.
- Keep coefficient signs exactly as written in standard form.
- Do not interpret an irreducible-over-integers result as having no roots.
- Use the multiplication or expansion table to verify every reported factorization.
- For formal coursework, present the method and notation required by the instructor.
Open Factoring and Number-Theory References
These OpenStax resources explain prime uniqueness, factor trees, polynomial GCFs, trinomial patterns, and solving quadratics by factoring. They support the mathematical scope of this page; a course's notation and required method may still differ.