# Total number of solutions of a completely blank sudoku

In how many ways can we fill a $9\times 9$ matrix with digits from 1 to 9 so that all rows, all columns and all the nine $3\times3$ submatrices [obtained after partitioning the bigger matrix into nine $3\times3$ matrices] contain all the digits from 1 to 9? In other words, what is total number of solutions of a completely blank sudoku. I have been grappling with this problem for months without success. Any help is greatly appreciated.

-