Result summary
Factor tree
For education only. The tool writes n as a product of primes and uses the exponents to compute τ(n) (number of divisors), σ(n) (sum of divisors), φ(n) (totient), and—when m is given—gcd and lcm via min/max exponents. Trial division up to 6k ± 1 remains fast for classroom-sized integers (≈10¹³).
FAQ
What integers can this tool factor?
Enter any integer with |n| ≥ 2. Very large values are supported, but the division steps may take longer to finish.
How is the factor tree drawn?
Each composite node splits by its smallest prime factor until every leaf is prime. The tree updates automatically after each calculation.
What do τ(n), σ(n), and φ(n) represent?
τ(n) is the number of positive divisors of n, σ(n) is the sum of those divisors, and φ(n) counts the integers between 1 and n that are coprime to n. This calculator derives all three directly from the exponents in the prime factorization.
Why can we get gcd and lcm from exponents?
If n and m are written as products of prime powers, then the gcd takes the minimum exponent of each prime and the lcm takes the maximum exponent. The exponent table in this calculator is a visual summary of that rule.