Prime numbers are a fundamental concept in number theory and play a central role in mathematics and its applications. They are natural numbers greater than 1 that have no divisors other than 1 and themselves, meaning they cannot be divided evenly by any other numbers. Prime numbers are the building blocks of all natural numbers, as every integer greater than 1 can be uniquely factored into a product of prime numbers. This is known as the Fundamental Theorem of Arithmetic.
Key Characteristics of Prime Numbers:
 Only Two Factors: A prime number has exactly two factors: 1 and itself.
 Odd Numbers (except for 2): Most prime numbers are odd; the only even prime number is 2.
 Infinite in Number: There are infinitely many prime numbers, as proven by the ancient Greek mathematician Euclid.
Importance and Applications: Prime numbers have fascinated mathematicians for centuries due to their intriguing properties and essential role in various areas of mathematics and beyond:
 Mathematics: Prime numbers are the building blocks of integers, making them crucial for number theory.
 Cryptography: Prime numbers play a key role in modern cryptography, especially in public key encryption methods like RSA, which rely on the difficulty of factoring large numbers into primes.
 Computer Science: Prime numbers are used in hashing algorithms and random number generators.
 Physics and Engineering: Prime numbers often appear in various scientific and engineering problems.
List of Prime Numbers: The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and so on. The primes continue indefinitely and become less frequent as numbers grow larger.
How to Identify Prime Numbers: To determine whether a number is prime, you can check whether it has any divisors other than 1 and itself. This can be done by testing divisibility with numbers up to the square root of the number in question.
Prime vs. Composite Numbers: While prime numbers have only two factors, composite numbers have more than two factors, as they can be divided evenly by numbers other than 1 and themselves.
Prime numbers are an essential part of mathematical study and have numerous practical applications in the modern world. Understanding and exploring the properties of primes is a cornerstone of number theory and mathematical problemsolving.
Also Read:
Trigonometry Formulas – List of All Trigonometric Identities and Formulas
What are Prime Numbers?
Prime numbers are a special set of integers greater than 1 that are distinguished by their simplicity and uniqueness in terms of factors. They are numbers that are only divisible by 1 and themselves, meaning they have exactly two distinct factors. This definition forms the basis for identifying and classifying prime numbers:
 Two Factors: A prime number has precisely two factors: 1 and the number itself. No other numbers can divide a prime number evenly.
 Greater than 1: Prime numbers start from 2, which is the smallest prime number and the only even prime number. All other prime numbers are odd.
In contrast, numbers greater than 1 that are not prime are called composite numbers. Composite numbers have more than two factors, as they can be divided evenly by integers other than 1 and themselves. Composite numbers can be expressed as the product of two or more positive integers, which may include primes.
Key Points:
 Examples of Prime Numbers: Some prime numbers are 2, 3, 5, 7, 11, 13, 17, and so on. They become less frequent as numbers increase, but they continue indefinitely.
 Composite Numbers: In contrast, composite numbers have more than two factors. For example, 4 is a composite number because it can be factored as 2 × 2.
Understanding prime numbers is essential in various areas of mathematics, especially in number theory, and they play a critical role in applications such as cryptography, computer science, and problemsolving. Identifying prime numbers and distinguishing them from composite numbers is a foundational aspect of mathematics.
Also Read:
Numbers in Words: Number Names and Examples from 1 to 1000
First Ten Prime Numbers
The first ten primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29.
Note: It should be noted that 1 is a nonprime number. It is a unique number.
History of Prime Numbers:
The study of prime numbers dates back thousands of years, and it holds a foundational place in the history of mathematics. One of the earliest methods for identifying prime numbers was developed by the ancient Greek mathematician Eratosthenes (c. 275–194 BCE). He invented the “Sieve of Eratosthenes,” a systematic way to filter out composite numbers from a list of natural numbers and identify primes. The sieve is an elegant and efficient method that involves crossing out multiples of each prime from a list, leaving only prime numbers.
Properties of Prime Numbers:
Prime numbers have several important properties that make them special in mathematics:
 Unique Factors: Every number greater than 1 can be uniquely factored into prime factors. This is known as the Fundamental Theorem of Arithmetic.
 Sum of Two Primes: Every even positive integer greater than 2 can be expressed as the sum of two prime numbers. This is known as Goldbach’s conjecture, which remains an unproven hypothesis in mathematics.
 Oddness (except for 2): With the exception of 2, all prime numbers are odd numbers.
 Coprime Relationship: Any two prime numbers are coprime, meaning their greatest common divisor (gcd) is 1. This is because a prime number has only two factors, 1 and itself.
 Distinct Prime Factors: Every composite number can be expressed as a product of distinct prime factors, and this representation is unique for each number.
Prime Numbers Chart:
Before the era of calculators and computers, mathematicians used charts and tables to record prime numbers and their factorizations up to certain limits. One of the most wellknown methods for listing prime numbers is the sieve of Eratosthenes. This method efficiently filters out composite numbers and highlights the primes.
Here’s how the Sieve of Eratosthenes works:
 Write down a list of natural numbers starting from 2.
 Circle 2, and cross out all its multiples (4, 6, 8, etc.).
 Move to the next uncrossed number, which is 3, and circle it. Then cross out all its multiples (9, 12, 15, etc.).
 Repeat this process for each remaining uncrossed number, crossing out its multiples.
 Continue this process until you’ve reached the square root of the highest number in your list.
The remaining uncrossed numbers in the list are prime. This method can be used to generate charts and tables of prime numbers up to a certain limit, providing a visual representation of primes in a specified range.
The sieve of Eratosthenes and prime number charts have been instrumental in the historical study of prime numbers and continue to be important for educational purposes and in mathematical research.
List of Prime Numbers 1 to 100
There are several primes in the number system. As we know, the prime numbers are the numbers that have only two factors which are 1 and the number itself.
The list of prime numbers from 1 to 100 are given below:
Prime Numbers between 1 and 100  
Prime numbers between 1 and 10  2, 3, 5, 7 
Prime numbers between 10 and 20  11, 13, 17, 19 
Prime numbers between 20 and 30  23, 29 
Prime numbers between 30 and 40  31, 37 
Prime numbers between 40 and 50  41, 43, 47 
Prime numbers between 50 and 60  53, 59 
Prime numbers between 60 and 70  61, 67 
Prime numbers between 70 and 80  71, 73, 79 
Prime numbers between 80 and 90  83, 89 
Prime numbers between 90 and 100  97 
Thus, there are 25 prime numbers between 1 and 100, i.e. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97. All these numbers are divisible by only 1 and the number itself. Hence, these numbers are called prime numbers. Also, these are the first 25 prime numbers.
Prime Numbers 1 to 200
Here is the list of prime numbers from 1 to 200, which we can learn and crosscheck if there are any other factors for them.
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199 
Prime Numbers 1 to 1000
There are a total of 168 prime numbers between 1 to 1000. They are:
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997. 
Facts About Prime Numbers
The table below shows the important points about prime numbers. These will help you to solve many problems in mathematics.
Smallest Prime Number  2 
Largest Prime Number  As of November 2022, the largest known prime number is 2^{82,589,933} – 1, with 24,862,048 digits.
It was founded by the Great Internet Mersenne Prime Search (GIMPS) in 2018. 
Even Prime Number  2 is the only even prime number, and the rest of the prime numbers are odd numbers, hence called odd prime numbers. 
Twin Prime numbers  The prime numbers with only one composite number between them are called twin prime numbers or twin primes. The other definition of twin prime numbers is the pair of prime numbers that differ by 2 only. For example, 3 and 5 are twin primes because 5 – 3 = 2. The other examples of twin prime numbers are:

Coprime numbers  Two numbers are called coprime to each other if their highest common factor is 1. Prime numbers and coprime numbers are not the same. For example, 6 and 13 are coprime because the common factor is 1 only. 
How to Find Prime Numbers?
To determine whether a given number is prime, there are a couple of methods you can use. These methods leverage certain properties of prime numbers to efficiently check whether a number is prime:
Method 1: The Form of $6n±1$
 Concept: Prime numbers (other than 2 and 3) can often be found in the form of $6n−1$ or $6n+1$, where $n$ is an integer.
 Application: This method can help identify potential prime candidates. If a number can be expressed as $6n−1$ or $6n+1$ for some integer $n$, then it could be a prime number, but it still needs to be tested for primality.
Example:
 For $n=1$:
 $6⋅1−1=5$ (5 is prime)
 $6⋅1+1=7$ (7 is prime)
 For $n=2$:
 $6⋅2−1=11$ (11 is prime)
 $6⋅2+1=13$ (13 is prime)
While these numbers may fit the pattern, the method alone is not enough to prove primality. Further testing is needed.
Method 2: Polynomial Prime Numbers
 Concept: For primes greater than 40, the polynomial $n_{2}+n+41$ yields prime numbers for $n=0,1,2,…,39$.
 Application: The expression $n_{2}+n+41$ can be used to generate potential primes up to 80. However, it’s important to check each output to confirm whether it is prime.
Example:
 For $n=0$:
 $_{2}+0+41=41$ (41 is prime)
 For $n=1$:
 $_{2}+1+41=43$ (43 is prime)
 For $n=2$:
 $_{2}+2+41=47$ (47 is prime)
Other Methods for Testing Primality
 Trial Division: For any given number $p$, check divisors from 2 up to the square root of $p$. If $p$ is not divisible by any of these numbers, it is prime.
 Sieve of Eratosthenes: An efficient algorithm for finding all primes up to a given number. It involves iteratively marking the multiples of each prime starting from 2.
 Primality Tests: For larger numbers, primality tests such as the MillerRabin or AKS primality tests are more efficient.
These methods provide different ways of checking whether a given number is prime. While Method 1 and Method 2 offer potential prime candidates, using a more comprehensive method like trial division or a primality test is necessary to confirm whether a number is actually prime.
Is 1 a Prime Number?
No, 1 is not a prime number.
According to the definition of a prime number, a prime number is an integer greater than 1 that has exactly two positive factors: 1 and itself. For a number to be considered prime, it must be divisible by exactly two distinct integers.
The number 1 only has one positive factor: 1 itself. It is not divisible by any other number (including itself as a separate distinct integer), which means it does not meet the criteria of having exactly two distinct factors. Therefore, 1 is not considered a prime number.
Examples of prime numbers include 2, 3, 5, 7, 11, and so on. All of these numbers are greater than 1 and are divisible only by 1 and themselves.
Prime Numbers and the Fundamental Theorem of Arithmetic
The Fundamental Theorem of Arithmetic states that every positive integer greater than 1 can be expressed uniquely as a product of prime factors, up to the order of the factors. This theorem establishes the importance of prime numbers as the basic building blocks of integers, underpinning the entire structure of arithmetic.
Prime Number Theorems
Several theorems describe the behavior and distribution of prime numbers:
 The Prime Number Theorem provides an asymptotic estimate for the density of prime numbers among integers, stating that the number of primes less than $n$ is approximately equal to $lognn $.
 Bertrand’s Postulate (also known as Bertrand’s Theorem) asserts that for every integer $n>1$, there exists at least one prime number $p$ such that $n<p<2n$.
These theorems offer valuable insights into the occurrence and distribution of primes.
Riemann Hypothesis and Prime Numbers
The Riemann Hypothesis is a famous conjecture in mathematics that concerns the distribution of prime numbers. It involves the zeros of the Riemann zeta function, a complex function that extends the concept of the sum of prime numbers. Proving this hypothesis would have significant implications for understanding prime number distribution, among other areas in mathematics.
Applications in Cryptography
Prime numbers play a pivotal role in modern cryptography. For example:
 RSA Encryption: This publickey cryptosystem relies on the difficulty of factoring the product of two large prime numbers. The security of RSA encryption depends on the fact that it is computationally difficult to factor a large composite number.
 DiffieHellman Key Exchange: This protocol uses large prime numbers for securely exchanging cryptographic keys over a public channel.
Twin Primes and Prime Gaps
 Twin Primes: Twin primes are pairs of prime numbers that differ by exactly 2 (e.g., 3 and 5, 11 and 13). While twin primes are known to exist, the twin prime conjecture—which asserts that there are infinitely many twin primes—remains unproven.
 Prime Gaps: The gap between consecutive primes tends to increase as numbers get larger. Studying the size and distribution of prime gaps is an active area of research, with questions such as the Cramér’s conjecture providing challenging problems for mathematicians.
These additional topics deepen the understanding of prime numbers and their impact across various mathematical fields and realworld applications.
Prime Numbers vs Composite Numbers
Solved Examples on Prime Numbers:
Here are 10 solved examples on prime numbers to help you understand how to identify and work with them:
Example 1: Determine if 29 is a prime number.
Solution: To find out if 29 is prime, we check for factors other than 1 and 29. We test divisors from 2 up to the square root of 29 (approximately 5.39).
 29 ÷ 2 = 14.5
 29 ÷ 3 = 9.67
 29 ÷ 4 = 7.25
 29 ÷ 5 = 5.8
None of the divisions results in an integer, so 29 is a prime number.
Example 2: List the prime numbers between 10 and 20.
Solution: The numbers between 10 and 20 are 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, and 20. Among these, 11, 13, 17, and 19 have only two factors (1 and themselves) and are prime.
Example 3: Identify the next prime number after 37.
Solution: The number immediately after 37 is 38. We need to test each number to find the next prime:
 38 is even and therefore not prime.
 39 is divisible by 3 and therefore not prime.
 40 is even and therefore not prime.
 41 is only divisible by 1 and 41.
Thus, the next prime number after 37 is 41.
Example 4: Determine if 49 is prime.
Solution: To check if 49 is prime, test for factors from 2 up to the square root of 49 (which is 7):
 49 ÷ 2 = 24.5 (not an integer)
 49 ÷ 3 = 16.33 (not an integer)
 49 ÷ 4 = 12.25 (not an integer)
 49 ÷ 5 = 9.8 (not an integer)
 49 ÷ 6 = 8.17 (not an integer)
 49 ÷ 7 = 7 (integer)
Since 49 is divisible by 7, it is not prime.
Example 5: Determine if 83 is prime.
Solution: Check for factors from 2 up to the square root of 83 (approximately 9.11):
 83 ÷ 2 = 41.5
 83 ÷ 3 = 27.67
 83 ÷ 4 = 20.75
 83 ÷ 5 = 16.6
 83 ÷ 6 = 13.83
 83 ÷ 7 = 11.86
 83 ÷ 8 = 10.38
 83 ÷ 9 = 9.22
None of the divisions results in an integer, so 83 is a prime number.
Example 6: List the prime numbers between 90 and 100.
Solution: The numbers between 90 and 100 are 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, and 100. Among these, only 97 is prime.
Example 7: Find the prime numbers between 40 and 50.
Solution: The numbers between 40 and 50 are 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, and 50.
 41, 43, and 47 are only divisible by 1 and themselves, so they are prime.
Example 8: Is 2 a prime number?
Solution: Yes, 2 is prime. It is divisible only by 1 and itself and is the smallest prime number.
Example 9: Identify the prime factors of 45.
Solution: To find the prime factors of 45, perform prime factorization:
 Divide 45 by 3: $45÷3=15$.
 Divide 15 by 3: $15÷3=5$.
 5 is prime.
So, the prime factors of 45 are 3, 3, and 5.
Example 10: Check if 11 and 13 are twin primes.
Solution: The difference between 11 and 13 is $13−11=2$. Since both 11 and 13 are prime numbers, and their difference is 2, 11 and 13 are twin primes.