45887291domain: NPropertiesPrimalityPrimeyesAppears in sequencesSmallest 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=24A074347Prime numbersat n=2768660