Prime Factorisation & Primality Checker

Check whether a whole number is prime and break it into prime factors in exponent form, with exact BigInt arithmetic for very large numbers.

Runs on your device

Result

Results appear here as you type.

What it does

Enter any whole number. Factors are found by trial division with a 6k ± 1 wheel, which is instant for numbers whose second largest prime factor is below about ten billion.

How to use it

  1. Enter a whole number of 2 or more.
  2. Read the factorisation and number of divisors.
  3. Use it for GCD, LCM or simplification work.

Example

360 = 2³ × 3² × 5, with 24 divisors. Select Try an example above to see it.

When it helps

  • Number theory homework.
  • Simplifying radicals and fractions.
  • Checking RSA toy examples.

Questions

Is 1 prime?

No. A prime has exactly two distinct divisors, and 1 has only one.

How large can the number be?

Up to 30 digits. Factorisation stops with a message if a very large prime factor makes it too slow.

More student & maths tools

See all 12

People also use

Browse all 200 tools