41673714

Appears in sequences

• Numbers k such that reverse(k) = sum of the proper divisors of k.at n=3A072234
• Consider the aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to the reverse of themselves.at n=14A247012
• Numbers n such that if m = reverse(sigma(n)-n) then n = reverse(sigma(m)-m).at n=13A251810
• Numbers that divide the reverse of the sum of their aliquot parts.at n=9A254005