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 located before a number, or the nth previous prime number smaller than/inferior to a given number.

Answers to Questions

How to calculate the previous prime number?

No mathematical formula is used to automatically calculate the prime number preceding any number. dCode perform primality tests on numbers below the requested number until a prime number is found.

Example: The largest prime number that precedes 100 is 97

Example: The 10th prime number preceding 1000 is 937 (so there are 9 prime numbers between 938 and 999)

The number must be a positive real number.

How to find greatest primes with n digits ?

The first prime number preceding \( 10^n \) is a number with \( n \) digits which is the greast n-digit coprime number.

Example: 7, 97, 997, 9973, 99991, etc.

What are twin primes numbers?

A prime number and the previous prime number are twins primes when their difference equals 2.

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

Ask a new question

Source code

dCode retains ownership of the source code of the script Previous 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 Previous Prime Number script for offline use, check contact page !