An integer n>1 is said to be highly cototient if the equation x - ϕ(x) = n has more solutions than the equations x - ϕ(x) = k for all 1

cototient | highly composite number | prime number | totient function