So I'm taking the free online Stanford class in Cryptography, and the first assignment has one of those "with a little thought you can solve this in a loop with less than 2^28 iterations" problems. For kicks, I thought I'd run it on an Arduino as well as on my (someone aged) 2.8GHz Xeon desktop. The straightforward implementation takes about 7500 seconds on a 16MHz Arduino. A bit of obvious optimization (eliminating 32bit multiplications and modulus and replacing them with repeated additions and conditional bounds checking) reduces that to only about 1500s.
It takes about 0.5s on the desktop (either way.)
So there you have it. An Arduino is about 15000 times slower than a Mac.