A standard deck of playing cards has 13 spades. How many ways can these 13 spades be arranged?

The solution to this problem involves calculating a factorial. Since we want to know how 13 cards can be arranged, we need to compute the value for 13 factorial.

13! = (1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13) = 6,227,020,800