Andrew Booker's Nth prime page is excellent... but it can't handle your example number.
I have custom code that can calculate values up to about 2^64, but your number is larger than that.
Thanks to Dusart [1], we can say that its rank is somewhere between 24244547260299402427 and 24247918127257270377.
If the Riemann Hypothesis is true, then we know by Schoenfeld [2] that its rank is somewhere between 24245911027060346607 and 24245911157987206331.
[1] Pierre Dusart, 'Estimates of Some Functions Over Primes without R.H.', preprint (2010), arXiv:1002.0442
[2] Lowell Schoenfeld, 'Sharper Bounds for the Chebyshev Functions theta(x) and psi(x). II'. Mathematics of Computation, Vol 30, No 134 (Apr 1976), pp. 337-360.