Find the prime factorization and the complete list of divisors of any positive integer.
📖 Trial Division FactorizationFill in the fields on the left with your information, then press Calculate to see your result instantly. No sign-up required, and no data is sent anywhere — everything is calculated right in your browser.
The factor calculator breaks down any positive integer into its basic components in two complementary ways. The first is "prime factorization," which means writing the number as a product of prime numbers only (numbers divisible only by themselves and 1), through repeated division by the smallest possible prime number (2, then 3, then 5, and so on) until the result is 1 or a prime number. The second is listing "all divisors," meaning every integer that divides the entered number without a remainder, including 1 and the number itself. Prime factorization is used mainly in simplifying fractions, finding the greatest common divisor and least common multiple, and in the fundamentals of modern cryptography. Every positive integer greater than 1 has exactly one prime factorization — a foundational fact known as the Fundamental Theorem of Arithmetic — which is precisely why prime factorization is such a reliable, unambiguous way to describe a number's underlying structure.
Every positive integer greater than 1 can be broken down into prime numbers multiplied together in exactly one way, aside from the order the primes are written in — a fact formal enough to have its own name, the Fundamental Theorem of Arithmetic. This uniqueness is what makes prime factorization such a powerful and reliable tool: two numbers are fundamentally different if and only if their prime factorizations are different.
Finding a number's prime factorization by repeated division follows a simple, mechanical process: divide by the smallest prime that evenly divides the number (starting with 2, then 3, 5, 7, and so on), replace the number with the result of that division, and repeat until the remaining number is itself prime or equal to 1. This process always terminates and always produces the same final set of prime factors regardless of the order in which primes happen to be tried.
Listing all divisors of a number is a related but distinct task — every integer that divides the number evenly, not just the prime ones. A number's complete list of divisors can actually be derived directly from its prime factorization: every possible combination of the prime factors (including using each prime zero times, up to its full count in the factorization) produces exactly one distinct divisor, which is why numbers with more repeated prime factors tend to have noticeably more total divisors than numbers of a similar size built from fewer, larger primes.
Prime factorization is the underlying tool behind both the GCD and LCM calculations covered elsewhere on this site — before the more efficient Euclidean algorithm became standard, GCD and LCM were traditionally found by comparing the prime factorizations of the numbers involved directly, identifying which prime factors they shared.
Modern cryptography depends on prime factorization in a very specific and consequential way: many widely used encryption schemes rely on the fact that multiplying two very large prime numbers together is computationally fast, while reversing the process — factoring the resulting large product back into its two original primes — is, for sufficiently large primes, prohibitively slow even for powerful computers. This asymmetry between easy multiplication and hard factorization is the mathematical foundation securing much of the encrypted communication used across the modern internet.
It's expressing a number as a product of prime numbers only, showing the basic 'building blocks' that multiply together to make it.
Prime factors are only the prime numbers that build up the number through multiplication, while all divisors include every number (prime or not) that divides it evenly, including 1 and itself.
No, by mathematical definition 1 is neither prime nor composite, so it has no prime factorization of its own.