Python Answer to Embedly's Challenge 1

challenge1.py

def badr(n):
    return 1 if n is 1 else n * badr(n - 1)

n = 1;
while(reduce(lambda x, y: int(x) + int(y), str(badr(n))) != 8001):
    n = n + 1 

print n;