I'm trying to computer the two rightmost digits in $3^{40000005}$. Can this be done using the Euler Totient function alone as:
For every digit $m >1$,
$$m = \prod_{i = 1}^{n}p_i^{e_i}$$ where the $p_i$'s are distinct primes and $e_i$ > 0, then the Euler Totient function is:
$$ \phi(m) = \prod_{i = 1}^{n}(p_i^{e_i}-p_i^{e_i-1})$$
Well, yes, you can calculate $\varphi(100)$, that will be a period of powers of $3$ modulo $100$.
We are looking for the last two digits, ie. the remainder modulo $100$ of $3^{400..005}$.
By the Euler-Fermat theorem, as $3$ is coprime to $100$, we know that $3^{\varphi(100)}\equiv 1\pmod{100}$.
Then find the remainder $r$ of the exponent modulo $\varphi(100)$ and the answer will be the same as the last two digits of $3^r$.