Let $\varphi(\cdot)$ denote the Euler function, and let $a>1$ be a fixed integer. We study several divisibility conditions which exhibit typographical similarity with the standard formulation of the Euler theorem, such as $a^n \equiv 1\!\!\!\!\pmod{\varphi(n)}$, and we estimate the number of positive integers $n\le x$ satisfying these conditions.