dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Tool to search for prime numbers following a number, or the nth prime number greater than a given number.

Answers to Questions

How to calculate the next prime number?

There is no formula to find the next prime number. dCode uses an algorithm that performs a primality test on each of the numbers greater than or equal to the number requested.

Example: The first prime number following 1000 is 1009.

Example: The 10th prime number after 100 is 149 (so there are 9 prime numbers between 101 and 148)

The number must be a positive real number (the decimal numbers are accepted).

How to find smallest primes with n digits ?

The first prime number following \( 10^(n-1) \) is a number with \( n \) digits which is the smallest n-digit prime number.

Example: 2, 11, 101, 1009, 10007, etc.

What are twin primes numbers?

A prime number and the next prime number are said to be twins if their difference is 2.

Example: 11 and 13 are twins primes because 13-11 = 2.

Ask a new question

Source code

dCode retains ownership of the source code of the script Next Prime Number online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. So if you need to download the online Next Prime Number script for offline use, check contact page !

dCode uses cookies to customize the site content, analyze user behavior and adapt dCode to your use. Some data is stored and collected for advertising purposes and may be shared with our partners. OK