6.22702 E+9
13! = 6,227,020,800
factorial of -1
Factorial 6 = 720
In Prolog, a simple factorial program can be defined using recursion. Here's a basic implementation: factorial(0, 1). % Base case: factorial of 0 is 1 factorial(N, Result) :- N > 0, N1 is N - 1, factorial(N1, Result1), Result is N * Result1. % Recursive case You can query the factorial of a number by calling factorial(N, Result). where N is the number you want to compute the factorial for.
Factorial(0), or 0! = 1.
13! = 6,227,020,800
The number of permutations of 13 things taken 13 at a time is 13 factorial, or 6,227,020,800.
The value of 9 factorial plus 6 factorial is 363,600
It is 4060.
factorial of -1
6.334 * 10^702
Factorial 6 = 720
27 factorial = 10,888,869,450,418,352,160,768,000,000
1 factorial = 1
Zero factorial = 1
Factorial 65 = 8247650592082470666723170306785496252186258551345437492922123134388955774976000000000000000
18 factorial is 6,402,373,705,728,000.