Evaluate ($396396396\dots$ up to $300$ digits) $\bmod{101}$
I know that a number when repeated $(p-1)$ times is completely divisible by $p$ where $p$ is a prime number.
But I am not able to understand how to apply that here because here we have repetition in groups of $3.$
Edit :-
I did not understand this base conversion thing, does this property ("a number with (p-1) digits repeated, when divided by p gives a remainder of 0, where p is a prime number ") hold true in all bases ? How can we divide numbers with different bases ? Why are we not converting 101 as well to higher base ?