$e^{\pi\sqrt N}$ is very close to an integer for some smallish $N$s. What about $\pi^{e\sqrt N}$?
Up to 100000, the 10 best $N$ such that $e^{\pi\sqrt{N}}$ is almost an integer. The error $\delta$ is given such that the nearest integer is at $10^{\delta}$ from the result.
$$ \begin{array}{c|c} N & \delta \\\hline 163 & -12.12\\ 4\cdot163 & -9.79\\ 9\cdot163 & -8.01\\ 58 & -6.75\\ 16\cdot163 & -6.51\\ 67 & -5.87\\ 22905 & -5.61\\ 95041 & -5.55\\ 54295 & -5.37\\ 25\cdot163 & -5.2\\ \end{array} $$
As you can see, no $N$ beats 163 up to 100000. (For N = 4 x 163.)
For $\pi^{e\sqrt{N}}$, the behaviour is much more regular and you obtain :
$$ \begin{array}{c|c} N & \delta \\\hline 66972 & -5.03 \\ 85516 & -5.01 \\ 53204 & -4.91 \\ 46665 & -4.9 \\ 50237 & -4.8 \\ 93909 & -4.53 \\ 52970 & -4.4 \\ 10024 & -4.32 \\ 84702 & -4.17 \\ 6814 & -4.17 \\ \end{array}$$
So, it seems there is something strange in $e^{\pi\sqrt{N}}$ that makes that question interesting !
The phenomenon with the Heegner numbers can be generalized to,
$$e^{\pi/a\,\sqrt{-d}}\tag1$$
with discriminants $d=b^2-4ac$, of the quadratic,
$$P(n) = an^2+bn+c\tag2$$
These $d$ have very interesting properties.
I. Connection to prime-generating polynomials:
I'm sure you are familiar with Euler's,
$$P(n) =n^2+n+41\tag3$$
However, there are other optimum prime-generating polynomials with $a\neq1$,
$$P(n) =2n^2+29\tag4$$
$$P(n) =2n^2+2n+19\tag5$$
$$P(n) =3n^2+3n+23\tag6$$
$$P(n) =4n^2+163\tag7$$
$$P(n) =6n^2+6n+31\tag8$$
and others. Using the values of their $a,d$ into $(1)$, one gets,
$$\begin{aligned} &e^{\pi/1\,\sqrt{163}} = 640320^3 +743.999999\dots\\ &e^{\pi/2\,\sqrt{232}} = e^{\pi\sqrt{58}} = 396^4 -104.0000001\dots\\ &e^{\pi/2\,\sqrt{148}} = e^{\pi\sqrt{37}} = (84\sqrt{2})^4 +103.99997\dots\\ &e^{\pi/3\,\sqrt{267}} = 300^3 + 41.99997\dots\\ &e^{\pi/4\,\sqrt{10432}} = e^{\pi\sqrt{4\cdot163}} = (640320^3+744)^2 - 2\cdot \color{blue}{196883}.99999\dots\\ &e^{\pi/6\,\sqrt{708}} = 1060^2 + 9.99992\dots \end{aligned}$$
and so on.
- What's 196884? (OEIS)
- And here why $\log(196883) \approx 4\pi$ is important to quantum gravity. (Huh?)
More on these prime-generating polynomials here.
II. Connection to pi formulas:
In addition, each one of these integer approximations can be used in a Ramanujan-Sato pi formula. The most famous of course, is with $d = 4\cdot58$,
$$\frac{1}{\pi} = \frac{2 \sqrt 2}{99^2} \sum_{k=0}^\infty \frac{(4k)!}{k!^4} \frac{58\cdot455k+1103}{396^{4k}}$$
III. Connection to Pell equations:
Furthermore, they are also connected to Pell equations. For example, the fundamental solution to,
$$x^2-3\cdot163y^2 = 1$$
$$x,\;y = 7592629975,\;343350596$$
hence the fundamental unit,
$$U =x+y\sqrt{489} =7592629975+343350596\sqrt{489} = \big(35573\sqrt{3}+4826\sqrt{163}\big)^2$$
Then,
$$\Big(3\sqrt{3}\big(U^{1/2}-U^{-1/2}\big)+6\Big)^3 = 640320^3$$
You can read more in this MO post. There is a lot more to $e^{\pi\sqrt{n}}$ than being near-integers, it seems.