24103
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Third member of a sexy prime quadruple: value of p+12 such that p, p+6, p+12 and p+18 are all prime.at n=38A046123
- Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.at n=27A052166
- Primes p whose period of reciprocal equals (p-1)/9.at n=16A056214
- Primes whose digits can be arranged in increasing cyclic order - to form a substring of 123456789012345678901234567890...at n=37A068710
- Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.at n=18A076424
- Smallest prime ending in prime(n) and == 1 (mod prime(n)), or 0 if no such prime exists.at n=26A096069
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=42A100438
- Round(1000*x), where x is the solution to x = 3^(n-x).at n=27A103537
- Five-digit primes which use each of the decimal digits 0 through 4 exactly once.at n=6A109176
- Shifted Pascal sequence: p(x,n)=(1 + x)^(n + 1) + If[n < 2, 0, x*((1 - x)^(n + 1)*PolyLog[ -n, x]/x + (1 + x)^(n - 1))/2].at n=69A147532
- Primes formed by rearranging five consecutive decimal digits (avoiding leading 0).at n=6A156119
- Noncomposite numbers in the eastern ray of the Ulam spiral as oriented on the March 1964 cover of Scientific American.at n=23A168022
- Partial sums of A006567.at n=42A172463
- Primes whose digits can be arranged as consecutive digits (more precisely, to form a substring of 0123456789).at n=27A177119
- Primes whose digits are a permutation of (0, ..., m) for some m.at n=6A187796
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,1,1 for x=0,1,2,3,4.at n=8A197275
- Initial prime in prime triples (p, p+4, p+6) preceding the maximal gaps in A201596.at n=15A201597
- Number of unimodal functions [1..n]->[0..2].at n=26A223718
- Primes p such that b=2*p+1 is semiprime, c=2*b+1 is 3-almost prime and d=2*c+1 is 4-almost prime.at n=20A235646
- Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=24A250660