Jerry's favorite number is $97$.  He knows all kinds of interesting facts about $97$:

[list][*]$97$ is the largest two-digit prime.
[*]Reversing the order of its digits results in another prime.
[*]There is only one way in which $97$ can be written as a difference of two perfect squares.
[*]There is only one way in which $97$ can be written as a sum of two perfect squares. 
[*]$\tfrac1{97}$ has exactly $96$ digits in the [smallest] repeating block of its decimal expansion.
[*]Jerry blames the sock gnomes for the theft of exactly $97$ of his socks.[/list]

A repunit is a natural number whose digits are all $1$.  For instance, \begin{align*}&1,\\&11,\\&111,\\&1111,\\&\vdots\end{align*} are the four smallest repunits.  How many digits are there in the smallest repunit that is divisible by $97?$
To determine the number of digits in the smallest repunit that is divisible by \(97\), we need to find the smallest integer \(n\) such that the repunit \(R_n\) (which consists of \(n\) digits all being \(1\)) is divisible by \(97\).

A repunit \(R_n\) can be expressed as:
\[ R_n = \frac{10^n - 1}{9} \]

We need \(R_n\) to be divisible by \(97\), which means:
\[ \frac{10^n - 1}{9} \equiv 0 \pmod{97} \]

This implies:
\[ 10^n - 1 \equiv 0 \pmod{97} \]
\[ 10^n \equiv 1 \pmod{97} \]

We are looking for the smallest positive integer \(n\) such that \(10^n \equiv 1 \pmod{97}\). This \(n\) is known as the order of \(10\) modulo \(97\).

By Fermat's Little Theorem, since \(97\) is a prime number, we know:
\[ 10^{96} \equiv 1 \pmod{97} \]

This tells us that \(10^n \equiv 1 \pmod{97}\) for some \(n\) that divides \(96\). We need to find the smallest such \(n\).

To do this, we check the divisors of \(96\) (which are \(1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96\)) to find the smallest \(n\) for which \(10^n \equiv 1 \pmod{97}\).

1. \(10^1 \equiv 10 \pmod{97}\) (not \(1\))
2. \(10^2 \equiv 100 \equiv 3 \pmod{97}\) (not \(1\))
3. \(10^3 \equiv 10 \cdot 3 \equiv 30 \pmod{97}\) (not \(1\))
4. \(10^4 \equiv 10 \cdot 30 \equiv 300 \equiv 9 \pmod{97}\) (not \(1\))
5. \(10^6 \equiv 10^2 \cdot 10^4 \equiv 3 \cdot 9 \equiv 27 \pmod{97}\) (not \(1\))
6. \(10^8 \equiv 10^4 \cdot 10^4 \equiv 9 \cdot 9 \equiv 81 \pmod{97}\) (not \(1\))
7. \(10^{12} \equiv 10^8 \cdot 10^4 \equiv 81 \cdot 9 \equiv 729 \equiv 51 \pmod{97}\) (not \(1\))
8. \(10^{16} \equiv 10^8 \cdot 10^8 \equiv 81 \cdot 81 \equiv 6561 \equiv 64 \pmod{97}\) (not \(1\))
9. \(10^{24} \equiv 10^{16} \cdot 10^8 \equiv 64 \cdot 81 \equiv 5184 \equiv 43 \pmod{97}\) (not \(1\))
10. \(10^{32} \equiv 10^{16} \cdot 10^{16} \equiv 64 \cdot 64 \equiv 4096 \equiv 21 \pmod{97}\) (not \(1\))
11. \(10^{48} \equiv 10^{24} \cdot 10^{24} \equiv 43 \cdot 43 \equiv 1849 \equiv 3 \pmod{97}\) (not \(1\))
12. \(10^{96} \equiv 1 \pmod{97}\) (this is \(1\))

Since \(10^{96} \equiv 1 \pmod{97}\) and no smaller \(n\) satisfies this condition, the smallest \(n\) is \(96\).

Conclusion:
\(\boxed{96}\)