Primes, Prime Factorization & Divisors

Primes, Prime Factorization & Divisors

Local Processing

Decompose any positive integer into its canonical prime factor powers.

How It Works & Processing Standards

Enter values above to calculate results automatically. Check each input field for guidance and units.

Tool processing runs in your browser. If you create a calculator or conversion share link, its values are included in the URL. See the privacy policy for account, analytics and advertising data.

Four prime-related calculations in one tool. Choose one under "Calculation" and enter an integer.

What You Can Do

Prime factorization
Writes a number as a product of prime powers, like 360 = 2³ × 3² × 5.
Prime check
Checks that nothing but 1 and itself divides it.
Divisors
Lists every divisor in ascending order.
Primes in a range
Finds all primes between a minimum and maximum.

How to Use Primes, Prime Factorization & Divisors

  1. 1
    Choose a calculationPick one of the four.
  2. 2
    Enter an integerFor primes in a range, enter a minimum and maximum.
  3. 3
    Read and copyLists are copied as comma-separated values.

Examples

Factor 360
Input: n 360
Result: 2³ × 3² × 5
Is 97 prime?
Input: n 97 (prime check)
Result: True (true)
Divisors of 36
Input: n 36 (divisors)
Result: 1, 2, 3, 4, 6, 9, 12, 18, 36
Primes from 10 to 40
Input: Min 10, max 40
Result: 11, 13, 17, 19, 23, 29, 31, 37

Common Use Cases

  • Double-checking a GCD or LCM through factorization
  • Checking math homework or coding test answers
  • Choosing batch sizes from the number of divisors

Frequently Asked Questions (FAQ)

Is 1 a prime?

No. A prime is an integer of 2 or more with exactly two divisors, 1 and itself.

How large can the number be?

Factorization accepts integers from 2 to 2^53 − 1. Very large numbers can take a while.

Have feedback or ideas for this tool? Suggest & Inquire →