Mathematics · pattern A, Numeric fields
Enter a number for its prime factorisation, the complete list of divisors, how many there are and their sum.
every integer above 1 factorises uniquely into primes
The divisor count follows from the exponents: add one to each and multiply. 12 = 2²×3 has (2+1)(1+1) = 6 divisors.
2 × 2 × 2 × 3 × 3 × 5
360 factorises, so it is composite.
1divide by 2
trial division by successive primes until the quotient is 1
2divide by 2
trial division by successive primes until the quotient is 1
3divide by 2
trial division by successive primes until the quotient is 1
4divide by 3
trial division by successive primes until the quotient is 1
5divide by 3
trial division by successive primes until the quotient is 1
6divide by 5
trial division by successive primes until the quotient is 1
Every integer above one has exactly one prime factorisation, up to the order of the factors. That uniqueness is what makes factorisation a canonical form, and why the divisor-count formula and the GCF-from-factorisation method both work exactly.
If the number is not the part you are stuck on, that is what the service is for — a specialist who explains the working, not just the answer.
Arithmetic runs in double-precision floating point, so results beyond about fifteen significant figures are not exact. Where a question wants an exact fraction or surd, keep the exact form rather than a decimal.