74551

Properties

Appears in sequences

• Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.at n=15A074347
• Prime numbers p such that p +- ((p-1)/7) are primes.at n=34A137770
• Balanced primes of order fourteen.at n=14A300365
• Distance from 10^n to the next prime triplet.at n=31A357052
• Prime numbersat n=7353