A prime factor tree is a visual diagram that breaks down a composite number into its prime factors step by step. Starting from the original number at the top (the "root"), each composite number is split into two factors — one prime factor and the remaining quotient — forming branches like a tree. The process continues until all remaining numbers at the bottom (the "leaves") are prime numbers. For example, the number 60 is broken down as 60 → 2 × 30 → 2 × 2 × 15 → 2 × 2 × 3 × 5, revealing 2, 2, 3, and 5 as the prime factors.

Using our tool is simple: enter any positive integer between 2 and 999,999 into the input field and click "Generate Tree" (or press Enter). The tool instantly creates a visual factor tree diagram showing each decomposition step. Below the tree, you'll see the complete prime factorization in both product form (e.g., 60 = 2 × 2 × 3 × 5) and exponent form (e.g., 60 = 2² × 3 × 5), along with a step-by-step breakdown of the factorization process. You can also click the example buttons to explore preset numbers or use the "Random" button to discover new factorizations.

The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. This means that no matter how you decompose a number, you will always end up with the same set of prime factors. For example, 60 will always equal 2² × 3 × 5, regardless of the factorization path you take. This theorem is one of the cornerstones of number theory and underpins much of modern cryptography, including RSA encryption.

Prime factorization is fundamental to many areas of mathematics and computer science. It is the basis for simplifying fractions, finding greatest common divisors (GCD) and least common multiples (LCM), and solving problems in modular arithmetic. In modern cryptography, the security of RSA encryption relies on the fact that factoring extremely large numbers (with hundreds of digits) into their prime factors is computationally infeasible with current technology. Prime factorization also appears in areas like signal processing, coding theory, and even in understanding patterns in nature.

A prime number is a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself. Examples include 2, 3, 5, 7, 11, 13, and so on. A composite number is a natural number greater than 1 that has more than two positive divisors — meaning it can be factored into smaller positive integers. For example, 60 is composite because 60 = 2 × 30 = 3 × 20 = 4 × 15 = 5 × 12 = 6 × 10. The number 1 is a special case: it is neither prime nor composite, as it has only one positive divisor (itself).

Trial division is the simplest method for prime factorization. The algorithm works by testing divisibility starting from the smallest prime (2) and moving upward. For a given number n, we try dividing by 2 as many times as possible, then by 3, then by 5, and so on through all primes up to √n. Each time a division succeeds, we record that prime factor and continue with the quotient. This method is efficient for moderately sized numbers and is what our tool uses behind the scenes. For numbers up to 1 million, trial division runs in milliseconds in modern browsers.

All natural numbers greater than 1 can be prime factorized — this is guaranteed by the Fundamental Theorem of Arithmetic. Prime numbers themselves have a trivial factorization consisting of just the number itself (e.g., 17 = 17). The number 1 is a special case and is not considered to have a prime factorization since it is neither prime nor composite. Zero and negative numbers are not typically considered in the context of prime factorization, as the theorem applies to positive integers greater than 1.

Prime factorization has numerous real-world applications: Cryptography — RSA encryption, the most widely used public-key cryptosystem, relies on the difficulty of factoring large semiprimes (products of two large primes). Computer Science — Hash functions, pseudorandom number generators, and error-correcting codes often use prime numbers. Engineering — Gear design sometimes uses prime numbers of teeth to ensure even wear distribution. Digital Security — SSL/TLS certificates that secure websites depend on the computational hardness of factoring. Mathematics Education — Factor trees help students visualize number theory concepts and build foundational understanding of multiplication and division.