A new equation involving the euler function

For any given integer number n ≥ 1, the well-known Euler function is defined as the positive integer number which is no more than n and coprime with n. ω(n) is all the different prime factor numbers of n. In this paper, we use the new elementary methods to study the solutions of the equation φ(n^s) = 2^ω(ns), s ≥ 2, and give its all positive integer solutions.