Sheldon Prime
   HOME



picture info

Sheldon Prime
73 (seventy-three) is the natural number following 72 (number), 72 and preceding 74 (number), 74. In English, it is the smallest natural number with twelve letters in its spelled out name. It is the 21st prime number and the fourth star number. It is also the eighth twin prime, with 71 (number), 71. In mathematics 73 is the 21st prime number, and emirp with 37 (number), 37, the 12th prime number. It is also the eighth twin prime, with 71 (number), 71. It is the largest minimal Primitive root modulo n, primitive root in the first 100,000 primes; in other words, if is one of the first one hundred thousand primes, then at least one of the numbers 2, 3, 4, 5, 6, ..., 73 is a primitive root modulo . 73 is also the smallest factor of the first Composite number, composite generalized Fermat number in decimal: 10^+1=10,001=73\times 137, and the smallest prime Modular arithmetic#Congruence, congruent to 1 modulo 24 (number), 24, as well as the only prime repunit in octal (1118). It is t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 Ã— 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorization, factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow primality test, method of checking the primality of a given number , called trial division, tests whether is a multiple of any integer between 2 and . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE