Supposedly it did discover some interesting things from it. Like if the sum of the divisors of an integer is prime, then the number of divisors must be prime. That seems interesting, but I'm not a mathematician.
Well, let's see. Sum of divisors is product of 1+p+...+p^k so if that's prime then the number must be a prime power so only one p, and then if the number of terms in that sum is composite you get an obvious nontrivial factor for the sum of divisors, and we're done. I reckon something I can prove in two minutes without making use of the notion of refactorable numbers probably isn't a great argument for the importance of that notion.
Perhaps the point is that this theorem was discovered while thinking about refactorable numbers. I rather doubt it, but in any ...
If it's worth saying, but not worth its own post (even in Discussion), then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should be posted in Discussion, and not Main.
4. Open Threads should start on Monday, and end on Sunday.