Line up 5 friends for a photo. Any of the 5 can stand on the left. Once that spot is filled, 4 friends remain for the second spot, then 3, then 2, and the last friend takes the final spot. The number of line-ups is 5×4×3×2×1=120, written 5!.
Each new item multiplies the count by the new total. Add a sixth friend: in each of the 120 line-ups, the newcomer can slot into any of 6 places, so 6!=6×5!=720. That rule, n!=n×(n−1)!, is why factorials explode: 8!=40,320 and 12! is about 479 million. Run the rule backwards and it explains 0!=1: since 1!=1×0!, the value of 0! must be 1, which matches the single way to arrange nothing.
A factorial is not a power. 4!=4×3×2×1=24, but 44=4×4×4×4=256: a power repeats the same factor, while a factorial steps down by one each time. The power counts 4-letter strings when letters may repeat; the factorial counts orders that use each item exactly once. Arranging only some of the items, such as 2 of 4, is a permutation, 4×3=12, not 4!.
Think of it like this. A factorial counts down a shrinking menu. Hand out n different chocolates to n friends, one each: the first friend picks from all n, the next from n−1, and the last friend gets the one that remains. Multiply those menu sizes and you have n!, the number of ways the chocolates can be shared out.
Core idea. n! is the product of every whole number from n down to 1, and it counts how many ways to arrange n things in a row.