The prime factorization calculator above breaks a whole number down into the primes that multiply together to make it, and shows the work three ways: the factor tree, the expanded product, and the compact exponent form. For 360 that is 2 × 2 × 2 × 3 × 3 × 5, written more usefully as 2³ × 3² × 5. It also derives what the factorization tells you — the number of divisors, the distinct primes involved, and the largest prime factor.
Arb Digital publishes free tools that show their reasoning. If you only need to know whether a number is prime, our prime number checker answers that directly and quickly. If you want the greatest common factor or least common multiple of two numbers, the LCM and GCF calculator computes those without making you factor anything by hand. This page is for the full decomposition and what it reveals.
What This Prime Factorization Calculator Does
Enter any whole number from 2 upwards and the tool divides out prime factors in ascending order, printing each division as a step so you can follow the tree. The result appears as a repeated product and as exponent notation, since the exponent form is what most later work actually uses.
From that factorization it derives the divisor count using the exponent rule, identifies the distinct primes, and names the largest prime factor. If the number you enter is itself prime, the tool says so explicitly rather than returning a one-item list without comment. Very large inputs are refused with a message, because trial division on a large semiprime can take long enough to lock up a browser tab, and a page that hangs is worse than a page that declines.
How to Use It
- Enter a whole number of 2 or more. Numbers below 2 have no prime factorization: 1 has no prime factors and 0 has infinitely many.
- Press Factorise and read the headline product, which lists every prime factor with repetition.
- Check the exponent form in the results grid — that is the notation used in nearly every follow-on calculation.
- Follow the factor tree in the steps panel to see each division in order, smallest prime first.
- Use the divisor count if you need to know how many factors the number has in total, including 1 and itself.
The Method: Divide Out Primes in Order
The algorithm is trial division and it is exactly what you would do on paper. Start with the smallest prime, 2, and divide as many times as it goes in evenly. Move to 3, then 5, then 7, and continue with each successive candidate. Whatever is left when the divisor exceeds the square root of the remaining number must itself be prime, so it goes into the list as the final factor.
Following 360: it is even, so 360 ÷ 2 = 180. Still even, 180 ÷ 2 = 90. Still even, 90 ÷ 2 = 45. Now 45 is odd, so move on: 45 ÷ 3 = 15, and 15 ÷ 3 = 5. Five is not divisible by 3, and the next candidate 5 divides it exactly once to leave 1. The factors collected are 2, 2, 2, 3, 3, 5, which is 2³ × 3² × 5. Multiply back to check: 8 × 9 × 5 = 360.
The square-root stopping point deserves a moment. If a number n has a factor larger than its square root, it must also have the matching cofactor below the square root, and the smaller one would have been found first. So once the trial divisor passes √n with nothing found, no factor exists at all and n is prime. That single observation cuts the work from n steps to about √n, which is the difference between instant and impossible on large numbers.
Why the Factorization Is Unique
Every whole number above 1 has exactly one prime factorization, ignoring the order the factors are written in. This is the fundamental theorem of arithmetic, and it is the reason prime factorization is worth computing at all: the answer is a genuine fingerprint of the number, not one of several possible descriptions. There is no alternative set of primes that also multiplies to 360.
This uniqueness is also why 1 is not counted as prime. If it were, 360 would equal 2³ × 3² × 5 and also 1 × 2³ × 3² × 5 and also 1² × 2³ × 3² × 5, and uniqueness would collapse. Excluding 1 from the primes keeps the theorem clean, and that is the real reason behind a definition that otherwise looks arbitrary. Wolfram MathWorld sets out the statement and its consequences under the fundamental theorem of arithmetic.
What the Exponent Form Lets You Calculate
Once a number is in exponent form, several things become easy that are otherwise tedious. The divisor count is the product of each exponent plus one. For 360 = 2³ × 3² × 5¹ that is (3+1)(2+1)(1+1) = 24, so 360 has exactly 24 divisors. The logic is that any divisor is built by choosing how many 2s to include (0, 1, 2, or 3), how many 3s (0, 1, or 2), and how many 5s (0 or 1), and every combination gives a different divisor.
The greatest common divisor of two numbers is the product of their shared primes, each at the lower exponent. The least common multiple takes every prime appearing in either, at the higher exponent. For 360 = 2³ × 3² × 5 and 84 = 2² × 3 × 7, the greatest common divisor is 2² × 3 = 12 and the least common multiple is 2³ × 3² × 5 × 7 = 2520. This is also exactly how fraction reduction works, which is why the simplify fractions calculator can show shared prime factors alongside its answer.
A perfect square is a number whose every exponent is even, because a square root halves each exponent. 360 is not a perfect square since 2³ has an odd exponent, but 1024 = 2¹⁰ is, with a square root of 2⁵ = 32. The square root calculator handles the numeric side, and the exponent calculator works with powers directly.
Why Large Numbers Are Hard, and Why That Matters
Trial division is fast for ordinary numbers and hopeless for large ones. Factorising a number near a trillion takes up to a million divisions, which a browser handles in a moment. A number with forty digits, chosen as the product of two twenty-digit primes, would take longer than the age of the universe by this method — and no dramatically better general method is known.
That asymmetry is not a curiosity. Multiplying two large primes is trivial; recovering them from the product is not, and RSA encryption is built directly on that gap. The US National Institute of Standards and Technology sets key-size guidance in SP 800-57 Part 1, and those recommended sizes exist precisely because factoring difficulty grows so steeply with the number of digits.
Practically, it means this calculator has a limit and enforces it. A number above a trillion is rejected rather than attempted, because a browser tab that stops responding while grinding through trial division helps nobody. Within that range the answer is effectively instant.
Reading the Result
If the steps panel shows a single factor equal to your input, the number is prime — it has no divisors other than 1 and itself, and no tree to draw. If it shows a single prime raised to a power, the number is a prime power, like 1024 = 2¹⁰, which behaves distinctively in most number-theory work. If it shows exactly two primes with exponent 1 each, the number is a semiprime, the shape used in cryptography.
The largest prime factor is worth a glance on its own. A number whose largest prime factor is small relative to its size is called smooth, and smooth numbers are the ones that divide evenly into all sorts of convenient quantities. 360 is a good example: its largest prime factor is only 5, which is why it has 24 divisors and why it was chosen for degrees in a circle, minutes in six hours, and countless other divisions where you want many exact splits available. The factorial calculator deals with a related family of highly divisible numbers.
Arb Digital builds fast, accessible, dependency-free calculators that earn organic search traffic and keep readers on the page. Browse the library, or tell us what you need built.
Browse All Free Tools Talk to Arb DigitalCommon Mistakes to Avoid
- Including 1 as a prime factor. One is not prime, and including it would destroy the uniqueness of the factorization.
- Stopping at composite factors. Writing 360 as 8 × 45 is a valid split but not a factorization — both parts still break down further.
- Dropping repeated primes. 360 is 2³ × 3² × 5, not 2 × 3 × 5; the exponents carry essential information.
- Trial dividing past the square root. Once the divisor exceeds the square root of what remains, that remainder is prime and the work is done.
- Trying to factorise 0 or 1. Neither has a prime factorization, and the theorem applies only to whole numbers greater than 1.
Related Free Tools From Arb Digital
Test primality directly with the prime number checker, which answers yes or no without producing a factor list, and compute shared factors with the LCM and GCF calculator, which gives the greatest common factor and least common multiple without a manual factorization. Apply the same factors to fractions with the simplify fractions calculator, work with powers using the exponent calculator, or explore remainders with the modulo calculator. More at the free online tools hub.
Frequently Asked Questions
It is writing a whole number as a product of prime numbers. For 360 the prime factorization is 2 × 2 × 2 × 3 × 3 × 5, which is written compactly as 2³ × 3² × 5.
Divide by the smallest prime that goes in evenly, then repeat on the quotient with the same or the next prime. Continue until the remaining number is 1, and the divisors you used are the prime factors.
Yes. The fundamental theorem of arithmetic guarantees that every whole number above 1 has exactly one set of prime factors, apart from the order in which they are written.
Because including it would break uniqueness — any factorization could be padded with any number of 1s. Excluding 1 keeps every number's factorization to a single form.
Add 1 to each exponent in the prime factorization and multiply the results. For 360 = 2³ × 3² × 5¹, that gives 4 × 3 × 2 = 24 divisors in total.
A prime number checker only reports whether a number is prime. This tool produces the complete list of prime factors with their exponents, which is a much larger job for composite numbers.
Trial division becomes slow on very large numbers, and an unbounded attempt could freeze the browser tab. The limit keeps every answer effectively instant, and the difficulty of factoring large numbers is itself the basis of RSA encryption.
This tool is provided for educational and general reference use. Always check results against the method your course or specification requires.
