Is [Number] Prime?

Did you ever wonder if 1331 is a prime number?

Wonder no more!

Using this application below, we can directly find the answer ✅

---

---

Above is an application to check whether a positive integer is a prime number.

Type your number input on the application, then simply press Enter or button.

---

Motivation

We sometimes saw peculiar number patterns, did we not? I, particularly, wondered, is that a prime number? 🤔

For instance, Boeing 737. The 737, it looks like a prime number.

Therefore, this post 🙂

---

Here is a list of prime numbers from 1 to 1,000.

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

The chunking above is my own display customisation 🙂

These are the tools for generating prime numbers:

• Generate prime numbers within a given range ➡️ PriNuTor.2.
• Generate prime numbers from a given starting point ➡️ PriNuTor.

---

Snippet

This is the function to check whether a positive integer is a prime number.

/** * MIT License (@ MonkeyRaptor) - https://opensource.org/licenses/MIT * * Checks whether a positive integer is a prime number. * * @param {number} numberInput - A positive integer input. * @returns {boolean} - If it is a prime number, returns true. Otherwise, false. * * @example * isPrime(2); * // Returns true. * * isPrime(20); * // Returns false. */ function isPrime(numberInput) { let limit; let mod = 2; let output = true; if (numberInput >= 2 && numberInput % 1 === 0) { limit = Math.floor(Math.sqrt(numberInput)); while (mod <= limit) { if (numberInput % mod === 0) { output = false; break; } mod += 1; } } else { output = false; } return output; };