281929

Appears in sequences

• Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=19A007755
• Smallest nonprime number which if used as initial term for iteration of the A000010[x] function, results in list-to-fixed-point of length=n, or 0 if no such number exists.at n=19A098196
• Totient highly abundant numbers that are composite.at n=18A286322
• Composite terms of A007755.at n=4A309672
• Composite terms of A181659, where the sum of the iterated totient function attains a record.at n=11A332737