Primeval Number

In mathematics, a primeval number is a natural number n for which the number of prime numbers which can be obtained by permuting all or some of its digits (in base 10) is larger than the number of primes obtainable in the same way for any smaller natural number. Primeval numbers were first described by Mike Keith. The first few primeval numbers are 2, 13, 37, 107, 113, 137, 1013, 1037, 1079, 1237, 1367, ... ; the number of primes that can be obtained from the primeval numbers is 1, 3, 4, 5, 7, 11, 11, 19, 21, 26, 29, ... . The number of primes that can be obtained from a primeval number with n digits is 1, 4, 11, 31, 106, ... .

External links

 

<< PreviousWord BrowserNext >>
coding theory
crimp
pseudo octave
doon de mayence
quality practice award
ogier the dane
cullen number
list of british columbia rivers
aurora toolset
king in the mountain
battle of worringen
list of alberta rivers
quasiperfect number
semiperfect number
primitive semiperfect number
osborne reynolds
international talk like a pirate day
environment 2004
rama lilas
agnihotra
seven sleepers
weird number
shruti
ilkley moor
smriti
on ilkla moor baht'at
honeypot ant
elbasan
sky digital
brahmana
aranyaka
prefecture of ilia
saab 99
list of municipalities in the prefecture of ilia
vlachs
list of misconceptions
m4 carbine
list of municipalities of greece
list of municipalities of the prefecture of achaea
woodall number
allan turoff
arrondissement in france
bayard
nibiru