than any other integer below k and above one. Here, φ is Euler's totient function. There are infinitely many solutions to the equation for k = 1 so this value is excluded in the definition. The first few highly cototient numbers are:
There are many odd highly cototient numbers. In fact, after 8, all the numbers listed above are odd, and after 167 all the numbers listed above are congruent to 9 modulo 10.
The concept is somewhat analogous to that of highly composite numbers. Just as there are infinitely many highly composite numbers, there are also infinitely many highly cototient numbers. Computations become harder, since integer factorization does, as the numbers get larger.