Resources · Education · Math
What Is a Prime Number?
A prime number is a whole number greater than 1 whose only positive divisors are 1 and itself. In other words, a prime number cannot be divided evenly by any other number without leaving a remainder. Whole numbers greater than 1 that are not prime are called composite numbers. Understanding primes is foundational to fields like number theory, algebra, and modern computer encryption.
6 min read
Sieve of Eratosthenes: Primes Highlighted (1 to 30)
Prime vs. Composite Numbers
Every positive integer greater than 1 falls into one of two categories:
Prime Numbers
A whole number greater than 1 that cannot be formed by multiplying two smaller natural numbers. Its only factor pairs are 1 and itself.
Examples: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47...
Composite Numbers
A positive integer that has at least one divisor other than 1 and itself. Composite numbers can be broken down into smaller whole factors.
Examples: 4 (2 × 2), 6 (2 × 3), 8 (2 × 4), 9 (3 × 3), 10 (2 × 5)...
Finding Prime Numbers: The Sieve of Eratosthenes
One of the oldest and most efficient ways to find all prime numbers up to a specific limit is the Sieve of Eratosthenes, invented by an ancient Greek mathematician. Here is how it works:
- Write down a list of numbers starting from 2 up to your limit (e.g., 2 to 30).
- Circle the first number in the list (2), which is prime. Then, cross out all multiples of 2 (4, 6, 8, etc.) because they are composite.
- Move to the next uncrossed number (3). Circle it as prime, and cross out all of its remaining multiples (9, 15, 21, etc.).
- Repeat this process for the next uncrossed numbers (5, 7, etc.).
- Once you have checked up to the square root of your limit, all remaining uncrossed numbers on your list are prime numbers.
How to Check If a Number Is Prime
To determine if a larger number is prime without drawing a sieve, you can use the method of trial division:
Divide the target number by every prime number less than or equal to its square root. If any division results in a whole number (no remainder), the number is composite. If none of these primes divide the number evenly, the number is prime.
Example: Is 47 prime?
1. Find square root of 47: √47 ≈ 6.85.
2. List all prime numbers ≤ 6.85: 2, 3, and 5.
3. Test divisibility:
· 47 ÷ 2 = 23.5 (No)
· 47 ÷ 3 = 15.67 (No)
· 47 ÷ 5 = 9.4 (No)
Since 47 is not divisible by 2, 3, or 5, it is a prime number.
Factorization Utilities
Need to analyze factors, prime trees, or check primality instantly? Use our math solvers:
Frequently asked questions
By convention, 1 is excluded from being prime to preserve the Fundamental Theorem of Arithmetic, which states that every integer greater than 1 has a unique prime factorization. If 1 were prime, we could write 6 as 2 × 3, 2 × 3 × 1, 2 × 3 × 1 × 1, etc., destroying the uniqueness of factorization.
The number 2 is the only even prime number. Every other even number (4, 6, 8, 10, etc.) is divisible by 2, meaning they have at least three factors (1, 2, and themselves) and are composite.
Yes. Euclid proved that there are infinitely many prime numbers around 300 BC. As numbers get larger, primes become less frequent, but they never stop appearing altogether.
A prime number has only two factors (1 and itself). Coprime numbers (or relatively prime numbers) are a pair of numbers that share no common factors other than 1. For example, 8 and 9 are both composite numbers, but they are coprime to each other because their only shared divisor is 1.