A factor calculator finds every positive integer that divides a given number with zero remainder. For 12, the factors are 1, 2, 3, 4, 6, and 12; for 7, only 1 and 7. The tool reports three views at once: the full sorted factor list, the factor pairs (1×12, 2×6, 3×4 for 12), and the prime factorization (12 = 2² × 3). Together these three pieces answer almost every question you can ask about a number's multiplicative structure — useful for simplifying fractions, computing GCFs and LCMs, finding common denominators, checking divisibility, and learning the deeper structure of integers covered by the Fundamental Theorem of Arithmetic.
What is a factor?
A factor of n is a positive integer that divides n exactly — leaving no remainder. Equivalently, k is a factor of n if there exists another integer m such that k × m = n. Every positive integer has at least two factors: 1 and itself. Numbers with exactly those two factors are called primes; numbers with more than two are called composites; and 1 is a special case (it has only one factor — itself), which is why the modern convention is to classify it as neither prime nor composite. Factors are also called divisors, and the two words mean exactly the same thing.
How to calculate factors?
The naïve algorithm tests every integer from 1 up to n itself, which works but is wasteful. The efficient method takes advantage of factor symmetry: if k divides n, then n/k also divides n, and these come in pairs around √n. So you only need to test divisors up to √n — every factor you find below the square root gives you its companion above for free. For n = 12, √n ≈ 3.46, so test 1, 2, and 3: each divides, giving pairs (1, 12), (2, 6), (3, 4). For n = 7, √n ≈ 2.65, test 1 and 2: only 1 divides, so factors are just 1 and 7 — that's how we conclude 7 is prime. This √n speedup is what makes factor-finding tractable; without it, factoring a 20-digit number would take longer than the age of the universe even on a fast computer.
- Start with the positive integer n whose factors you want to find.
- Test every integer k from 1 up to ⌊√n⌋ (the floor of the square root). You do not need to test beyond √n — factor pairs are symmetric.
- For each k that divides n with no remainder, record both k and the partner n/k. If k = n/k (only happens when n is a perfect square), record k just once.
- Sort the collected factors in ascending order; that's the full factor list. Pair them by matching k with n/k for the factor-pair view.
- To extract prime factorization, divide n by 2 as many times as possible, then by 3, then 5, 7, 11, ... until what remains is 1. The counts of each prime form the exponent vector.
- The result is three coordinated outputs: factor list, factor pairs, and prime factorization.
Example
- The factors of 12 are 1, 2, 3, 4, 6, and 12. Factor pairs: (1, 12), (2, 6), (3, 4). Prime factorization: 12 = 2² × 3. Total factor count: τ(12) = (2+1)(1+1) = 6.
- The factors of 7 are 1 and 7. Factor pairs: just (1, 7). Prime factorization: 7 is itself prime. τ(7) = 2.
Factors are foundational to number theory, fraction simplification, GCF and LCM computation, and modern cryptography (RSA relies on the difficulty of factoring large composites). Understanding factors also helps with mental arithmetic — knowing that 60 = 2² × 3 × 5 immediately tells you 60 is divisible by every number up to 6, which is why so many ancient calendars and currencies used base-60 or base-12.
Factor Pairs
Factor pairs are two factors that multiply back to give the original number. For 12, the pairs are (1, 12), (2, 6), (3, 4) — exactly three pairs because 12 has six factors. The number of factor pairs is τ(n) / 2 if n is not a perfect square; if n is a perfect square (like 36 = 6²), one pair is (√n, √n) — a self-pair — and the count is ⌈τ(n) / 2⌉.
Prime Factors
Prime factors are the prime numbers whose product (with possibly repeated factors) equals n. For 12: 12 = 2 × 2 × 3 = 2² × 3, so the prime factors are 2 and 3, with multiplicities 2 and 1. The Fundamental Theorem of Arithmetic guarantees that every integer greater than 1 has a unique prime factorization (up to ordering), which is why prime factorization is the canonical form for an integer's multiplicative DNA.
Applications of Factors
- Finding the greatest common factor (GCF / GCD) of two or more numbers — used to simplify fractions to lowest terms
- Finding the least common multiple (LCM) — used to add fractions with different denominators and to schedule periodic events
- Simplifying fractions — divide numerator and denominator by their GCF
- Prime factorization — the canonical form for any integer's multiplicative structure
- Number theory and mathematical proofs — congruences, divisibility tests, Diophantine equations
- Cryptography (RSA, Diffie-Hellman) — the difficulty of factoring large semiprimes secures public-key encryption
Frequently Asked Questions
Factor and divisor are exactly the same thing — two words for one concept. Both describe a positive integer that divides a given number with no remainder. So the factors of 12 are 1, 2, 3, 4, 6, 12, and equivalently, the divisors of 12 are 1, 2, 3, 4, 6, 12. A multiple goes the other direction: a multiple of n is any number you can get by multiplying n by a positive integer. So multiples of 12 are 12, 24, 36, 48, 60, ... — an infinite list. A prime factor is a factor that happens to also be prime. The prime factors of 12 are 2 and 3 (1 is excluded because it isn't prime); the non-prime factors are 4, 6, and 12 themselves. The relationship between these is that the prime factors raised to specific exponents reconstruct all factors: every factor of 12 has the form 2^a × 3^b with 0 ≤ a ≤ 2 and 0 ≤ b ≤ 1, giving exactly (2+1)(1+1) = 6 combinations.
Because factors come in pairs that bracket √n. If k is a factor of n, then n/k is also a factor, and one of them is always ≤ √n while the other is ≥ √n (with equality only when n is a perfect square and k = √n). Suppose to the contrary that n had two factors both above √n; their product would exceed n, contradicting them being factors. So scanning k from 1 to ⌊√n⌋ is enough — each successful divisor gives you two factors at once, and you've captured them all by the time you hit √n. This is the speed-up that makes trial division usable: for n with a hundred digits, the naïve search 1 to n is impossible, but searching 1 to √n is only fifty digits — still huge for cryptographic-size n, but tractable for everyday numbers. The same ⌊√n⌋ bound is the loop limit in textbook primality-testing code: keep dividing trial primes 2, 3, 5, 7, ... until you exceed √n, and if nothing divided, n is prime.
Yes, an exact one, derived from the prime factorization. If n = p₁^a₁ × p₂^a₂ × ... × pₖ^aₖ (prime factorization), then the count of factors is τ(n) = (a₁ + 1)(a₂ + 1)...(aₖ + 1). Each factor is built by choosing how many of each prime to include — 0 through aᵢ of pᵢ — and the choices multiply. Example: 12 = 2² × 3¹, so τ(12) = (2+1)(1+1) = 6, matching {1, 2, 3, 4, 6, 12}. Example: 60 = 2² × 3 × 5, so τ(60) = 3 × 2 × 2 = 12 factors. Example: 1,000,000 = 2⁶ × 5⁶, so τ(1,000,000) = 7 × 7 = 49 factors. Highly composite numbers (numbers with more factors than any smaller positive integer) crop up at 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 360, 840, 2520, ... — a famous sequence studied by Ramanujan. Note that 360 has 24 factors, 60 has 12 — which is why both numbers anchor ancient calendars (Babylonian degrees, Sumerian hours), and why 12 and 60 still appear in clocks, geometry, and units.
Prime factorization breaks a number into a product of primes with multiplicities. 12 = 2 × 2 × 3 = 2² × 3; 100 = 2 × 2 × 5 × 5 = 2² × 5²; 360 = 2³ × 3² × 5. The Fundamental Theorem of Arithmetic guarantees that every integer greater than 1 has exactly one prime factorization (up to ordering the factors). This is not obvious — you might think different multiplication paths could give different prime sets, but the theorem rules that out: a number's prime factorization is its multiplicative DNA. The proof uses Euclid's lemma: if a prime p divides a product ab, then p must divide either a or b (or both). This lemma plus induction shows that any two different factorizations would have to share the same primes with the same multiplicities. The Fundamental Theorem underlies everything in elementary number theory; without uniqueness, GCF, LCM, modular arithmetic, and cryptography would all fall apart.
Finding factors of small numbers is trivial — trial division does it instantly. The problem becomes spectacularly hard for n with hundreds of digits, especially when n is the product of two primes of similar size (a "semiprime"). Trial division up to √n means scanning roughly 10^(d/2) candidates where d is the digit count of n; a 200-digit semiprime requires 10^100 trial divisions, more than the number of atoms in the observable universe. Better algorithms exist (the General Number Field Sieve has subexponential complexity), but factoring a 2048-bit (~617-digit) semiprime is still beyond classical computing as of 2026. RSA encryption is built on this asymmetry: the public key is a 2048-bit (or larger) semiprime n; encrypting and verifying signatures requires only modular exponentiation, which is fast; but decryption requires knowledge of the factors of n, which only the key holder has. Anyone who could factor n would break the encryption. Shor's algorithm on a sufficiently large quantum computer could factor in polynomial time, which is why post-quantum cryptography is now an active field of research.
A highly composite number is one with more factors than any smaller positive integer. The sequence starts 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, ... Each new entry sets a record for τ(n). These numbers have an unusually high density of small prime factors — typically 2³ × 3² × 5 × 7 × ... in increasing powers — which makes them especially good for division. Historical examples: the ancient Babylonians chose 60 as the base for time and angles partly because 60 is divisible by 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60 — twelve clean divisors. The 360 degrees in a circle inherits this property: 360 = 2³ × 3² × 5 with 24 divisors. The dozen (12) and gross (144 = 12²) endure in commerce for the same reason — splitting a dozen into halves, thirds, quarters, sixths is trivial; splitting ten into thirds is not. Ramanujan first systematically studied these numbers in 1915. They are not the same as superior highly composite numbers, which use a slightly different definition based on a maximization criterion.
1 is neither prime nor composite. By the modern definition, a prime is a positive integer with exactly two distinct positive divisors. 1 has only one divisor (itself), so it fails the definition. This was not always the convention — Euclid considered 1 "the unit" and excluded it from primes; later mathematicians flip-flopped for centuries — but by the 20th century the consensus settled because excluding 1 keeps the Fundamental Theorem of Arithmetic simple. If 1 were prime, prime factorizations wouldn't be unique: 6 = 2 × 3 = 1 × 2 × 3 = 1 × 1 × 2 × 3 = ... For 0: every integer is technically a factor of 0 (because 0 × anything = 0), making 0 have infinitely many factors and putting it outside ordinary factorization theory. By convention, factor calculators only handle positive integers, and 0 is excluded from the input domain. The factors of 1 are just {1} itself — the smallest meaningful case.
Many. (1) Music: 12-tone equal temperament works because 12 is highly composite, allowing octaves (12 → 6), fifths (12 → 4 ≈ 7 semitones), thirds, and many other intervals to land on or near simple ratios. (2) Calendars and clocks: 60 seconds, 60 minutes, 24 hours, 12 months — all built on highly composite numbers for divisibility. (3) Cryptography: RSA, Diffie-Hellman, and elliptic-curve crypto all rely on hard factorization or related hard problems. (4) Hashing and load balancing: choosing a prime number of buckets for a hash table avoids collision patterns when input data has factor structure. (5) Music synthesizers and signal processing: FFT works fastest when the sample length factors into many small primes; choosing 1024 (= 2¹⁰), 4096, or 65536 makes the algorithm log-linear. (6) Card games and dice: probability calculations constantly reduce to factor counts (52! orderings of a deck, hands of 5 from 52 = C(52,5)). (7) Mechanical gear ratios: gear teeth chosen so their factorization avoids common factors gives smoother long-term wear (the "hunting tooth" principle). (8) Graphic design and layout: page grids work cleanly when total width factors well — 12-column grids dominate web design because 12 has divisors 1, 2, 3, 4, 6, 12.
Calculator
Math
Have feedback? Report bugs, suggest features, or share your thoughts — we read them all
MATH CALCULATORS32
WUTOOLS