When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    Some sources only list the smallest prime in each cycle, ... All prime numbers from 31 to 6,469,693,189 for free download. Lists of Primes at the Prime Pages.

  3. Sieve of Eratosthenes - Wikipedia

    en.wikipedia.org/wiki/Sieve_of_Eratosthenes

    A prime number is a natural number that has exactly two distinct natural number divisors: the number 1 and itself. To find all the prime numbers less than or equal to a given integer n by Eratosthenes' method: Create a list of consecutive integers from 2 through n: (2, 3, 4, ..., n). Initially, let p equal 2, the smallest prime number.

  4. 53 (number) - Wikipedia

    en.wikipedia.org/wiki/53_(number)

    53 cannot be expressed as the sum of any integer and its decimal digits, making 53 the ninth self number in decimal. [4] 53 is the smallest prime number that does not divide the order of any sporadic group, inclusive of the six pariahs; it is also the first prime number that is not a member of Bhargava's prime-universality criterion theorem ...

  5. Prime number - Wikipedia

    en.wikipedia.org/wiki/Prime_number

    The numbers formed by adding one to the products of the smallest primes are called Euclid numbers. ... Prime numbers are used as a metaphor for loneliness and ...

  6. 43 (number) - Wikipedia

    en.wikipedia.org/wiki/43_(number)

    43 is a Heegner number. [4] 43 is the largest prime which divides the order of the Janko group J 4. 43 is a repdigit in base 6 (111). 43 is the largest natural number that is not an (original) McNugget number. [5] 43 is the smallest prime number expressible as the sum of 2, 3, 4, or 5 different primes: 43 = 41 + 2; 43 = 11 + 13 + 19; 43 = 2 ...

  7. Mersenne prime - Wikipedia

    en.wikipedia.org/wiki/Mersenne_prime

    The smallest composite Mersenne number with prime exponent n is 2 11 − 1 = 2047 = 23 × 89. Mersenne primes were studied in antiquity because of their close connection to perfect numbers : the Euclid–Euler theorem asserts a one-to-one correspondence between even perfect numbers and Mersenne primes.

  8. 10,000,000 - Wikipedia

    en.wikipedia.org/wiki/10,000,000

    72,546,283 = the smallest prime number preceded and followed by prime gaps of over 100 [37] [38] 73,939,133 = the largest right-truncatable prime number in decimal 74,207,281 = Mersenne prime exponent

  9. 41 (number) - Wikipedia

    en.wikipedia.org/wiki/41_(number)

    the 13th smallest prime number. The next is 43, making both twin primes. the sum of the first six prime numbers (2 + 3 + 5 + 7 + 11 + 13). the 12th supersingular prime [1] a Newman–Shanks–Williams prime. [2] the smallest Sophie Germain prime to start a Cunningham chain of the first kind of three terms, {41, 83, 167}.