Time complexity analysis for factorial sum


For a rough estimation,

let t = 0! + 1! + 2! + ...,+ (n-1)! + n!, can we assume t = O(n!) ?

let t = n + n(n-1) + n(n-1)(n-2) + ... + n!, can we assume t = O(n*n!) ?