The Phrygian Cap

2! = 2 ;)

#!/usr/bin/python
search_space = range(0, int(raw_input("Search space: 0 to (integer): "))+1)
def factorial(i):
result = i
for j in range(1, i):
result *= j
if result == 0:
result = 1
return result
for i in search_space:
si = str(i)
total = 0
for j in range(0, len(si)):
total += factorial(int(si[j]))
if total==i:
print str(si[0])+"!",
for j in range(1, len(si)):
print "+", str(si[j])+"!",
print "=", total

Hell if your blog preserves whitespace. =P

Interesting.

I searched every possible solution and 1, 2, 145 and 40585 are the only ones I could find.
9! is 362880 (6 digits), so you don't have to look any further than numbers of 7 digits. Because beyond 7 * 9! total number will grow faster than the sum of the factorials could ever grow.

Sorry for taking this too far :)

Interesting...

http://en.wikipedia.org/wiki/Factorion

@ ryan: less is more, the content is the only important part of the design of the blog.

@ walther: yes, the amount of times this happens is very low.

@ ilya: thanks for the link!