Surely subbing in the n value will give you total amount of bit operations need then multiplying by 10^-9 will give you the amount of seconds it takes.

Ex.

for n = 100 you get...

bit operations.

Multiply by 10^-9 to get roughly seconds.

By the way I got that to be centuries!