G. H. Hardy and S. Ramanujan observed that round numbers (those with prime factors repeated many times) are very rare. We seek to make the concepts of "roundedeness" and "rarity" precise by intoducing k-round numbers. We expolit density results for numbers with specified numbers of prime divisors. We discuss alternative approaches using i) normal orders of additive functions and ii) square-full numbers.
