
Curios:
Curios Search:
Participate: 
The nth Prime Page will now find any of the first 2.623˙10^{15} primes or
π(x) for x up to 10^{17}. 51 and its reversal (15) are each products of two Fermat primes. [Harari] (51) = 15. (x) = the number of primes less than or equal to x. [Gupta] 51 = 2 + 3 + 5 + 41 . It's the smallest number which can be written with all the digits from 1 to 5 (without repetition) as a sum of primes. Note that the highest digit (5) and the lowest digit (1) are the digits of 51. [Capelle] The first base not of the form n^x (where generalized repunits can be factored algebraically) for which there are no known generalized repunit primes.
(There are 5 curios for this number that have not yet been approved by an editor.) To link to this page use /curios/page.php?number_id=319
Prime Curios! © 20002016 (all rights
reserved)
