The number of possible total orderings that can be defined on a set of n elements is:
n
n!
n^2
n^n
n \log n
2^n
A total ordering can be viewed as a permutation of the elements.