Factor Calculator

What the Calculator Returns

Enter a whole number and the tool lists every positive integer that divides it without a remainder, groups those divisors into factor pairs, counts them, and writes the number as a product of primes. Behind the result is trial division up to the square root, which is enough to catch every divisor because factors always arrive in pairs.

Comma-separated inputs are handled one at a time, which is useful for comparing a set of numbers in a homework problem or checking several batch sizes in one pass. The output is sorted, so a missing divisor is easy to spot by eye: the list should be symmetric around the square root when read as pairs.

The tool is arithmetic, not proof. It will tell you that 91 = 7 × 13, but it will not tell you why the Fundamental Theorem of Arithmetic guarantees that no other prime factorization exists. That guarantee is what makes the prime form useful, and it is worth understanding separately from the button that produces it.

What Counts as a Factor

An integer a is a factor of b when b ÷ a leaves no remainder, which is the same as saying b = a × k for some integer k. The word divisor means the same thing in this context. For 30, the positive factors are 1, 2, 3, 5, 6, 10, 15, and 30, and they can be grouped as (1, 30), (2, 15), (3, 10), and (5, 6).

Two conventions are worth stating. First, 1 is a factor of every integer, and every integer greater than 1 is a factor of itself, so the smallest possible factor count for n > 1 is two. Second, 1 itself has exactly one positive factor, not two, which is one of the reasons it is treated as a special case rather than as a prime.

Negative divisors are valid in the algebraic sense: −3 divides 12 because 12 = −3 × −4. Most school problems ask only for positive factors, and this calculator follows that convention. If you are solving a Diophantine equation or working in a ring where signs matter, remember that each positive factor has a negative counterpart.

Factors also extend beyond the integers. In algebra, x − 2 is a factor of x² − 5x + 6 because the polynomial divides evenly. The arithmetic version is the foundation for polynomial factoring, which is why fluency with numerical divisors pays off later.

Prime Factorization

Every integer greater than 1 can be written as a product of primes, and the set of primes is unique apart from their order. That statement is the Fundamental Theorem of Arithmetic, and it is what makes prime factorization a kind of fingerprint. The number 360 is 2³ × 3² × 5, and no other combination of primes multiplies to 360.

Exponents compress repeated factors. Writing 2 × 2 × 2 × 3 × 3 × 5 is correct but unwieldy, and the exponent form makes the structure visible: three factors of 2, two of 3, one of 5. From that form you can read off the divisor count, which is (3 + 1)(2 + 1)(1 + 1) = 24, without listing anything.

The same form gives the greatest common factor and least common multiple of two numbers almost immediately. For 360 and 84 = 2² × 3 × 7, the GCF takes the smaller exponent of each shared prime, giving 2² × 3 = 12, and the LCM takes the larger exponent of every prime that appears, giving 2³ × 3² × 5 × 7 = 2,520. This is faster and less error-prone than listing divisors once the numbers get large.

Factoring is also the reason some encryption works. RSA keys are built from two large primes, and recovering them from the product is believed to be hard for classical computers when the primes are large enough. The security rests on the gap between multiplying, which is easy, and factoring, which is not known to be easy in general.

The Factor Tree

A factor tree turns factorization into a sequence of small divisions. Write the number at the top, split it into any factor pair, then split each composite branch again until every branch ends in a prime. The primes at the bottom, multiplied together, reconstruct the original number.

Reading the leaves gives 2 × 3 × 2 × 3 × 2 × 5, which rearranges to 2³ × 3² × 5. The tree is not unique: starting with 360 = 4 × 90 or 360 = 12 × 30 produces a different shape and the same leaves. That invariance is a practical demonstration of uniqueness, and it is why a teacher can accept any correct tree.

The method is slower than trial division by small primes for large numbers, but it is better for teaching because it shows the recursive structure. It also makes incomplete factorization visible: a branch that still has a composite number is an unfinished edge, not a result.

Reading the Output

The factor list is sorted ascending, and the count tells you how many positive divisors exist. A prime input returns exactly two entries, 1 and the number itself. A perfect square returns an odd count, because one pair has two equal members and only one distinct divisor is added. For 36, the pairs are (1, 36), (2, 18), (3, 12), (4, 9), and (6, 6), giving nine divisors.

Factor pairs are the same information arranged for multiplication. They are useful when the question is about arrangements rather than divisibility: 36 chairs can form a 1 × 36, 2 × 18, 3 × 12, 4 × 9, or 6 × 6 rectangle, and each pair is a distinct layout up to rotation.

The prime factorization uses exponents when a prime repeats. Check it by multiplying back out, especially for larger inputs. A quick sanity check is that the product of the prime powers must equal the original number, and the number of divisors must match the count implied by the exponents.

If you enter a number with many divisors, expect a long list. Highly composite numbers such as 720, 840, or 5,040 have far more divisors than their size suggests, and the output length is a hint about that structure rather than a bug.

Factor Pairs and Arrangements

A factor pair is two integers whose product is the target. For 48, the pairs are (1, 48), (2, 24), (3, 16), (4, 12), and (6, 8). Finding them systematically means testing integers from 1 to the square root: once you pass the square root, every new divisor you find is the smaller member of a pair you have already recorded.

The square-root boundary explains why the search can stop early. If a × b = n and a ≤ b, then a ≤ √n. Testing up to the square root therefore catches every pair exactly once. For 10,000, that means testing 100 numbers rather than 10,000, which is the difference between a quick mental check and an afternoon.

Perfect squares are the case where the pair has two equal members. For 144, the pairs run (1, 144), (2, 72), (3, 48), (4, 36), (6, 24), (8, 18), (9, 16), and (12, 12). The square root appears once as a divisor, which is why the total count is odd.

Arrangement problems are the most intuitive use. Tiling a 12 ft by 18 ft room with square tiles of whole-foot size requires a tile size that divides both dimensions, so the common factors of 12 and 18 are the candidates. The largest, 6, gives the fewest cuts and the least waste, which is why the greatest common factor shows up in practical planning as well as in fractions.

Common Factors and the GCF

A common factor divides two or more numbers at once. For 12 and 18, the shared divisors are 1, 2, 3, and 6, and the largest of them is the greatest common factor, 6. Listing works for small numbers; for large ones, two better methods take over.

The prime factorization method compares exponents. With 12 = 2² × 3 and 18 = 2 × 3², the shared primes are 2 and 3, and the smaller exponent of each is used, giving 2¹ × 3¹ = 6. The rule generalizes: the GCF is the product of shared primes raised to the smallest power that appears in every factorization.

The Euclidean algorithm is faster still and needs no factorization. Divide the larger number by the smaller, replace the larger with the remainder, and repeat until the remainder is zero. For 48 and 18: 48 = 2 × 18 + 12, then 18 = 1 × 12 + 6, then 12 = 2 × 6 + 0, so the GCF is 6. Each step reduces the numbers, and the process terminates because remainders strictly decrease.

The GCF and least common multiple are linked by GCF(a, b) × LCM(a, b) = a × b for positive integers. That identity is a useful check: if you compute one and the product does not match, the other is wrong. For 12 and 18, the GCF is 6 and the LCM is 36, and 6 × 36 = 216 = 12 × 18.

Factors and Multiples

Factors go inward and multiples go outward. A factor of 20 divides it, so it is at most 20; a multiple of 20 is 20 times an integer, so it is at least 20. The number 5 is a factor of 20, and 20 is a multiple of 5. The number 20 is both a factor of 20 and a multiple of 20, which is the one point where the two sets meet for positive integers.

Every positive integer has a finite list of factors and an infinite list of multiples. That asymmetry is why factoring terminates and multiplying does not. It also explains why the search for factors can stop at the square root while the search for multiples has no natural stopping point until you hit a bound you have chosen.

The distinction matters in fractions. Simplifying a fraction uses common factors of the numerator and denominator; finding a common denominator uses a common multiple. Mixing the two produces the classic error of adding denominators instead of finding their least common multiple, which is why 1/2 + 1/3 is 5/6 and not 2/5.

Zero is a special case worth a sentence. Every nonzero integer divides zero, so every nonzero integer is a factor of zero, while zero is a multiple of everything. School problems usually restrict to positive integers precisely to avoid that degeneracy.

Primes and Composites

A prime is an integer greater than 1 with exactly two positive divisors: 1 and itself. A composite has at least one more. The number 1 is neither, because it has only one positive divisor; treating it as prime would break the uniqueness of factorization, since 1 could be inserted any number of times.

The primes begin 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, and 47. Two is the only even prime, because every other even number is divisible by 2. Euclid proved that there are infinitely many primes by assuming a finite list and constructing a number that leaves a remainder of 1 when divided by each member of the list.

Primes thin out as numbers grow, but slowly. The prime number theorem says the count below x is asymptotic to x / ln x, so around 10,000 roughly one number in nine is prime, and around a billion roughly one in twenty-one. The distribution is irregular at small scales and remarkably regular in aggregate, which is the source of both open problems and practical algorithms.

Testing whether a number is prime is easier than factoring it. Trial division up to the square root settles small cases, and probabilistic tests such as Miller-Rabin handle large ones quickly with a vanishing chance of error. Factoring a product of two large primes is a different problem, and the asymmetry between testing and factoring is what public-key cryptography exploits.

Divisibility Rules

These shortcuts let you reject most candidates without long division. They follow from the base-ten representation of a number, which is why the rules for 2, 5, and 10 look at the last digit and the rules for 3 and 9 look at the digit sum.

The rule for 7 is less tidy but still useful: double the last digit, subtract it from the rest, and check whether the result is divisible by 7. For 245, double 5 to get 10, subtract from 24 to get 14, which is divisible by 7, so 245 is too. The process can be repeated on large numbers until the result is small enough to recognize.

Rules compose in one direction only. A number divisible by 2 and 3 is divisible by 6, because 2 and 3 are coprime. A number divisible by 2 and 4 is not necessarily divisible by 8; 12 is the counterexample. The rule is that divisibility by coprime factors implies divisibility by their product, not by their sum or by any factor that shares a divisor with another.

Where Factors Show Up

Layout and construction are the most visible applications. Tiles, pavers, and solar panels come in fixed sizes, and the dimensions of a surface determine which sizes fit without cuts. A 12 ft by 18 ft room accepts 1, 2, 3, or 6 ft square tiles evenly, with 6 ft producing the fewest pieces and the least waste.

Packaging and scheduling use the same arithmetic. A batch of 240 units can be divided into equal boxes of 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48, 60, 80, 120, or 240 units. If a shift schedule needs equal teams with no one left over, the number of staff must share a factor with the shift length, and the greatest common factor gives the largest team size.

Music theory is a less obvious case. Intervals correspond to frequency ratios, and simple ratios such as 2:1 for an octave and 3:2 for a perfect fifth come from small integer relationships. Rhythmic patterns also divide a bar into equal parts, and the factors of the beat count determine which subdivisions land on a beat.

Computer science uses factors in hashing, error-correcting codes, and cryptography. Hash table sizes are often chosen as primes to reduce clustering, and RSA depends on the difficulty of factoring a product of two large primes. The same concept that organizes a tiling problem also underpins the security of a bank transfer.

Finding Factors by Hand

Start with 1 and the number, then work upward through the small primes. The order matters because small factors are common and finding them early shrinks the remaining problem. Once you find a factor, record its partner immediately; that single step halves the number of checks you need.

Stop at the square root. If you have tested every integer up to √n and found nothing beyond 1 and n, the number is prime. If you have found some factors but not all pairs, the partners of the factors below the square root are the ones above it, and you can fill them in without testing.

Use the divisibility rules as a filter. Check 2, 3, 5, 11, and then the digit-sum rules before doing long division. For a number like 2,835, the digit sum is 18, so 3 and 9 divide it; 2,835 ÷ 7 = 405 confirms 7; the remaining quotient 405 = 3⁴ × 5, which completes the factorization.

Memorize the squares up to about 30². Recognizing 289 as 17², 361 as 19², or 529 as 23² turns a trial-division problem into a single observation and helps you see when a number is a perfect square.

Finally, verify by multiplying back. A factorization that does not reconstruct the original number is wrong regardless of how confident the intermediate steps felt, and the check takes seconds.

Common Mistakes

Omitting 1 and the number itself. Every integer greater than 1 has both, and a list that starts at 2 is incomplete. The only exception is 1, which has a single positive divisor and is neither prime nor composite.

Stopping at half the number. The only divisor larger than n/2 is n itself, so stopping at n/2 misses nothing. The rule that matters is stopping at √n, which is much earlier and still complete because every divisor has a partner.

Confusing factors with multiples. A factor divides the number and cannot exceed it; a multiple is produced by multiplying and cannot be smaller than it. Mixing the two produces errors in fraction problems, where simplifying needs factors and common denominators need multiples.

Leaving a composite in a factor tree. A branch ending in 12 or 15 is unfinished. The tree is complete only when every leaf is prime, and a partial tree will produce a partial factorization that multiplies back to the wrong number.

Overgeneralizing divisibility rules. Divisibility by 2 and 4 does not imply divisibility by 8. The product rule applies to coprime factors, which is why 2 and 3 combine into 6 while 2 and 4 do not combine into 8.

Assuming all factors are odd. Even numbers have even divisors, and a list that skips them will be short by half or more. Test 2 first, then work upward systematically.

Forgetting negative divisors. In algebra and number theory, −1, −2, and −3 are legitimate divisors of 6. School problems often restrict to positive factors, but the restriction should be stated rather than assumed.

Factors in Fractions

Simplifying a fraction means dividing the numerator and denominator by their greatest common factor. For 48/72, the GCF is 24, so both terms divide to give 2/3. Dividing by a smaller common factor still produces a correct but unsimplified result, which is why the greatest one is the useful target.

Comparing fractions uses common multiples. To compare 5/12 and 7/18, find the least common multiple of 12 and 18, which is 36, then convert: 15/36 and 14/36. The first fraction is larger. Using any common multiple works, but the least one keeps the numbers small.

Adding and subtracting follow the same pattern. For 1/6 + 1/8, the LCM is 24, giving 4/24 + 3/24 = 7/24. A common error is to add the denominators, which produces a denominator that has no relationship to either fraction and a result that cannot be simplified back to the correct value.

Factors also explain why some fractions have terminating decimals and others repeat. A fraction in lowest terms terminates exactly when its denominator has no prime factors other than 2 and 5, because those are the primes that divide 10. The denominator 40 = 2³ × 5 terminates; 12 = 2² × 3 repeats.

Final Thoughts

Factors connect several topics that are usually taught separately: divisibility, fractions, prime structure, and modular arithmetic. Once you can move between the factor list, the prime form, and the factor pairs, most of those topics become variations on one idea rather than separate sets of rules.

The prime factorization is the most compact description of a number's multiplicative structure. The divisor count, the GCF, the LCM, and the simplified fraction all follow from it. Learning to read that structure is more durable than memorizing a list for each number.

Use the calculator to check work and to handle large inputs, then reproduce a few small examples by hand so the output stays meaningful. For related tools, the GCF calculator handles common factors, the LCM calculator handles common multiples, and the prime factorization calculator focuses on the prime form.

One property worth testing on your own: consecutive integers are always coprime, because any common divisor would also divide their difference, which is 1. Try it with 14 and 15, or 20 and 21, and the factor lists will confirm it every time.