1. Write down all of its proper divisors (including 1 and the number itself)
2. Add the digits of these divisors.
3. Use this sum to repeat steps 1 and 2 until your number does not change.

Must the process terminate?
At what number(s) can the process terminate at?
What numbers <1000 take the most steps to terminate?

Okay, I understand now what you meant by the upper bound.  Thanks.

Yes, your bound allowed my to make the "48" statement.