Let σ ( n ) \sigma (n) denote the sum of all of the positive divisors of n n , and let s ( n ) = σ ( n ) − n s(n) = \sigma (n)-n denote the sum of the proper divisors of n n . The functions σ ( ⋅ ) \sigma (\cdot ) and s ( ⋅ ) s(\cdot ) were favorite subjects of investigation by the late Paul Erdős. Here we revisit three themes from Erdős’s work on these functions. First, we improve the upper and lower bounds for the counting function of numbers n n with n n deficient but s ( n ) s(n) abundant, or vice versa. Second, we describe a heuristic argument suggesting the precise asymptotic density of n n not in the range of the function s ( ⋅ ) s(\cdot ) ; these are the so-called nonaliquot numbers. Finally, we prove new results on the distribution of friendly k k -sets, where a friendly k k -set is a collection of k k distinct integers which share the same value of σ ( n ) n \frac {\sigma (n)}{n} .