540539

Properties

Appears in sequences

• Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=43A005520
• Worst cases for Pierce expansions (numerators).at n=47A006537
• Smaller of twin primes whose mean (average) is a multiple of A002110(6)=30030.at n=6A060232
• Primes of the form k# + (k+1)# +- 1, where k# = A002110(k) = primorial(k).at n=7A125191
• "Kaprekar quintuples": digits of X^5 taken D at a time sum to X (where D is number of digits in X.)at n=9A171500
• The lesser of twin primes p1 such that 2*p1 + p2 is a prime number (A174913) and also the lesser of other twin primes in A174913.at n=15A242772
• Square array A(n,k) = A276945(n,k)-1, read by descending antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.at n=29A286615
• Transpose of square array A286615.at n=34A286616
• Numbers k such that phi(sigma(k))/k < phi(sigma(m))/m for all m < k, where sigma is the sum of divisors function (A000203) and phi is Euler's totient function (A000010).at n=38A293711
• Numbers k such that phi(psi(k))/k < phi(psi(m))/m for all m < k, where phi is Euler's totient function (A000010) and psi is the Dedekind psi function (A001615).at n=40A293713
• Primes p such that (p-1)/2, (p-2)/3, 2*p+1, 3*p+2 are all prime numbers.at n=11A348307
• Prime numbersat n=44612