๐ข Prime Factorization
Prime factorization2ยณ ร 3ยฒ ร 5
Number of divisors24
Sum of divisors1170
Is prime?No
Factorizes an integer into its prime factors, shown in exponent notation (e.g. 360 = 2ยณ ร 3ยฒ ร 5), and automatically calculates its divisor count and divisor sum. Useful for studying number theory or understanding GCD/LCM more deeply.
How to use
- Enter an integer (1 or greater) to factorize.
- The prime factorization is shown in exponent notation.
- The divisor count, divisor sum, and whether the number is prime are shown as well.
FAQ
How is the divisor count calculated?
Add 1 to each prime factor's exponent, then multiply those together (e.g. 360 = 2ยณร3ยฒร5ยน โ (3+1)ร(2+1)ร(1+1) = 24 divisors).
What happens if I enter 1?
1 is treated as a special case with no prime factors; it has exactly one divisor (itself).
How large a number can this handle?
Integers up to one trillion (10ยนยฒ). Beyond that, trial-division factorization becomes too slow.