Search a number
tcefrep numbers
A number n such that σ(n) = n + rev(n). more

The known tcefrep numbers are :

Distribution of the remainders when the numbers in this family are divided by n=2, 3,..., 11. (I took into account 7 values, from 6 to 922964834547).

n\r 0  1 
252 2 
3700 3 
40052 4 
502212 5 
6500200 6 
71112011 7 
800220030 8 
9400000300 9 
100011202100 10 
1103000210100

A pictorial representation of the table above
motab
Imagine to divide the members of this family by a number n and compute the remainders. Should they be uniformly distributed, each remainder from 0 to n-1 would be obtained in about (1/n)-th of the cases. This outcome is represented by a white square. Reddish (resp. bluish) squares represent remainders which appear more (resp. less) frequently than 1/n.