What is the time complexity, in terms of Big O notation, for calculating the factorial of a number?

The time complexity for calculating the factorial of a number is O(n), where n is the number for which the factorial is being calculated.