Factors

A factor of a number is any whole number that divides into it evenly, with nothing left over. The factors of 12 are 1, 2, 3, 4, 6, and 12, because each one divides 12 with no remainder. Factoring sounds like a narrow, mechanical skill — and at the level of "find the answer," it is — but it underpins a surprising amount of everyday and advanced math: simplifying fractions, finding common denominators, splitting a group evenly, understanding why some numbers are "nicer" to work with than others, and eventually cryptography, where the difficulty of factoring very large numbers is what keeps encrypted data safe. This hub indexes a dedicated factors page for every number from 1 to 550. Each page shows the complete factor list, the prime factorization (the number broken down into a product of primes, like 60 = 2² × 3 × 5), and a short explanation of the reasoning specific to that number — whether it's prime (and therefore has only two factors, 1 and itself), a perfect square (which always has an odd number of factors, because one factor pairs with itself), or simply composite with an ordinary even factor count. The method behind every one of these pages is trial division up to the square root of the number, and it's worth understanding why that works rather than just trusting the output. If a number n has a factor pair (a, b) where a × b = n, then one of those two factors must be less than or equal to √n and the other must be greater than or equal to √n — they can't both be larger than the square root, because then their product would exceed n, and they can't both be smaller for the same reason in reverse. That means you only ever need to test divisors up to √n; once you find one, its pair (n divided by that divisor) comes for free. For 100, you'd only need to check up to 10: 1, 2, 4, 5, 10 all divide evenly, giving pairs (1,100), (2,50), (4,25), (5,20), and the middle value 10 pairs with itself since 10 × 10 = 100 — which is exactly why 100, a perfect square, ends up with an odd total factor count (nine factors: 1, 2, 4, 5, 10, 20, 25, 50, 100) instead of the even count most numbers have. A few patterns are worth knowing before you go looking up specific numbers. Prime numbers always have exactly two factors: 1 and themselves — nothing else, by definition. Perfect squares always have an odd number of total factors, for the pairing reason above. Highly composite numbers — values like 12, 24, 36, 48, 60, and 120 — pack in an unusually large number of factors relative to their size, which is precisely why they show up so often as "nice" numbers for dividing things evenly: a class of 24 students splits cleanly into groups of 2, 3, 4, 6, 8, or 12, while a class of 23 (prime) only splits into groups of 1 or 23. Factoring also connects directly to two other common tasks covered elsewhere on this site: finding the greatest common factor (GCF) of two numbers, which is the largest number that divides evenly into both, and finding the least common multiple (LCM), which is the smallest number both divide into evenly. Both rely on the same prime factorization shown on every page here — GCF takes the shared prime factors at their lowest shared power, LCM takes every prime factor at its highest power across both numbers. The GCF and LCM calculators and their companion learn guides walk through worked examples if you need the step-by-step version rather than just the definition. If you're checking factors for a specific practical reason — simplifying a fraction, splitting a bill evenly, or just settling a disagreement about whether a number divides evenly into another — the fastest path is to search the number directly. If you're here to actually learn the method so you can do it without a page in front of you, the How to Find the Factors of a Number guide walks through the trial-division method by hand with several worked examples, including how to handle numbers where the answer isn't obvious at a glance. One limitation worth stating plainly: this hub's dedicated factor pages stop at 550, not because factoring gets mathematically different above that point (the method is identical for any positive integer) but because the practically useful range for a reference site tapers off — very large numbers are rarely looked up by hand, and factoring them efficiently is itself a hard computational problem once they get large enough (which, again, is exactly the property cryptography exploits). For numbers above 550 that still fall within the site's general number range, the /number/ pages up to 1,000 still show the full factor list; they just don't get the extended factors-specific explanation this dedicated hub provides. Take 84 as a full worked example of the trial-division method described above. √84 is about 9.17, so only divisors from 1 through 9 need testing: 1 divides evenly (pair 84), 2 divides evenly (pair 42), 3 divides evenly (pair 28), 4 divides evenly (pair 21), 6 divides evenly (pair 14), and 7 divides evenly (pair 12) — while 5, 8, and 9 don't divide evenly and get skipped. That gives the complete factor list: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84 — twelve factors total, found by checking only nine candidate divisors instead of all eighty-four. The prime factorization is 2² × 3 × 7, found by repeatedly dividing out the smallest prime that still divides evenly: 84 ÷ 2 = 42, 42 ÷ 2 = 21, and 21 isn't divisible by 2 anymore, so move to 3: 21 ÷ 3 = 7, and 7 is itself prime, so the process stops. Multiplying 2 × 2 × 3 × 7 back together confirms 84, the same self-check every prime factorization on this site carries. A factor tree is the visual version of that same prime-factorization process, and it's often taught first because it's easier to follow on paper than a division algorithm. Starting from 84, split it into any two factors — say 4 and 21 — then keep splitting each branch until every leaf is a prime number: 4 splits into 2 and 2 (both prime, so those branches stop), and 21 splits into 3 and 7 (also both prime). Reading the four prime leaves off the bottom of the tree — 2, 2, 3, 7 — gives the identical prime factorization reached by repeated division, 2² × 3 × 7, no matter which two factors you happened to split off first. That's a genuinely useful property of prime factorization: unlike the ordinary factor list, which depends on which divisors you happen to test, the prime factorization of a number is unique regardless of the path taken to it — the Fundamental Theorem of Arithmetic, mentioned on the Primes hub, is exactly this guarantee. A concrete case where factoring earns its keep: splitting 36 cupcakes and 60 cookies into identical goodie bags with nothing left over and no type shorted unevenly between bags. The largest number of bags you can make is the GCF of 36 and 60. Factor both: 36 = 2² × 3², and 60 = 2² × 3 × 5. The GCF takes each shared prime at its lowest shared power — 2² and 3¹ are common to both — giving 2² × 3 = 12. Twelve bags, each holding 3 cupcakes and 5 cookies, uses every item with nothing left over. The same underlying factorization answers a differently-shaped question through LCM: if one event repeats every 36 days and another every 60 days, they next coincide on their LCM, found by taking each prime at its highest power across both numbers — 2², 3², and 5¹ — giving 4 × 9 × 5 = 180 days. Same two factorizations, two different formulas, two genuinely different real-world questions answered. A few mistakes come up often enough in factoring to flag directly. The most common is mishandling the divisor search's stopping point — forgetting to test all the way up to √n (and missing a factor pair as a result), or, more often, needlessly testing well past √n out of uncertainty about when it's safe to stop. A second common error is treating "prime factorization" and "the full factor list" as the same thing when they're related but distinct: the prime factorization of 84 is just 2² × 3 × 7 (the prime building blocks), while its full factor list has twelve entries, including composite factors like 12 and 21 that are combinations of those primes. A third mistake, especially with larger numbers, is losing track of which divisors have already been tested and duplicating or skipping one — exactly why working systematically upward from 1, pairing each divisor with its co-divisor as you go rather than searching at random, is worth the extra discipline even when it feels slower. One more practical framing worth having in mind: every factor pair of a number corresponds to a possible whole-number rectangle with that area. A garden plot of 84 square feet could be laid out as 1×84, 2×42, 3×28, 4×21, 6×14, or 7×12 — six distinct rectangular shapes, one for every factor pair found above, and no others, because no other whole-number pair multiplies to 84. A prime number like 13, by contrast, only allows one possible rectangle shape, 1×13, since 13 has no other factor pairs at all — a concrete, visual way to see why prime numbers are sometimes described as having no way to be arranged into a "nicer" rectangular shape than a single long strip.