Prime Factors Calculator

Find the prime factors of an integer.

Save

Inputs

Your values stay on this device.

Results

Prime Factors
Is Prime?No

Report

Export and share

Document

Copy and share

Assumptions

  • This calculator only supports positive integers greater than 1.
  • Decimal, blank, and non-finite inputs return an invalid result instead of being truncated.
  • The factor list uses repeated prime factors, so 12 appears as 2 × 2 × 3.

Sensitivity preview

Number -10%: Prime Factors 2 × 3 × 3 × 3

Number Current: Prime Factors 2 × 2 × 3 × 5

Number +10%: Prime Factors 2 × 3 × 11

Related Tools

View All

About this Prime Factorization

The Fundamental Theorem of Arithmetic states that every integer greater than 1 is either a prime number itself or can be represented as the product of prime numbers in a unique way. This calculator finds that unique 'signature' for any number.

Who this calculator is for

  • Students learning primes, composite numbers, and factor trees.
  • Anyone finding building blocks for GCD, LCM, or fraction simplification.
  • Curious users exploring divisibility patterns in whole numbers.

When to use it

  • Use it to break a number into prime building blocks before finding GCD or LCM.
  • Use it to check whether a number is prime or composite.
  • Use it when comparing factor structures across several integers.

How to use this calculator

  1. Enter an Integer (greater than 1).
  2. The tool calculates the list of Prime Factors.
  3. It also checks if the number itself is Prime.

Key assumptions

  • This calculator only supports positive integers greater than 1.
  • Decimal, blank, and non-finite inputs return an invalid result instead of being truncated.
  • The factor list uses repeated prime factors, so 12 appears as 2 × 2 × 3.

Accuracy and testing

Review formula sources, default test cases, assumptions, unit handling, rounding rules, and changelog for this calculator.

View accuracy page

How this calculator works

The calculator divides the number by the smallest possible prime (2), then continues dividing by primes (3, 5, 7, etc.) until the quotient is 1. The result is displayed as a multiplication string (e.g., 2 × 2 × 3).

Inputs explained

Number

Any positive integer greater than 1. Decimals are not supported.

Understanding your results

If the only factor is the number itself, it is Prime. Otherwise, it is Composite. The product of the factors will always equal your original input.

Example scenarios

Composite Number

Input: 60. Factors: 2 × 2 × 3 × 5.

Prime Number

Input: 17. Factors: 17 (It is Prime).

Key Features

  • Instant Decomposition
  • Prime Check
  • Step-by-step logic

Tips & Best Practices

  • Prime factorization is used in cryptography (RSA encryption) and for finding the Greatest Common Divisor (GCD) and Least Common Multiple (LCM).
  • Even numbers (except 2) are never prime.

Glossary of Terms

Prime Number
A number greater than 1 that has no positive divisors other than 1 and itself.
Composite Number
A positive integer that can be formed by multiplying two smaller positive integers.

Frequently Asked Questions

Is 1 a prime number?
No. By definition, a prime number must be greater than 1.
What is the largest prime factor?
For small numbers, it's easy to find. For massive numbers used in encryption, finding the largest prime factor is computationally difficult, which keeps data secure.