63769149440
domain: N
Appears in sequences
- Smallest solution to gcd(x, Rev(x)) = 2^n.at n=19A071686
- Least number with exactly n prime factors counted with multiplicity which gives a different number with exactly n prime factors counted with multiplicity when digits are reversed.at n=21A109018
- Smallest m such that m and reverse(m) each have n (not necessarily distinct) prime factors.at n=21A239697