94139561

Appears in sequences

• Smallest n-digit number m such that phi(10^n+1)=phi(m), gcd(10^n+1,m)=1 and 10 does not divide m, or zero if there is no such m.at n=7A147547