291008domain: NAppears in sequencesSmallest solution to gcd(x, Rev(x)) = 2^n.at n=5A071686Least k such that k and digit reversal of k both have n divisors, or 0 if no such number exists.at n=13A090315