2937856

Appears in sequences

• Smallest solution to gcd(x, Rev(x)) = 2^n.at n=9A071686
• Least k such that k and digit reversal of k both have n divisors, or 0 if no such number exists.at n=43A090315
• Smallest number m (not ending in a 0) such that m and its digit reversal A004086(m) both have n prime factors (counted with multiplicity).at n=11A237912