A composite positive integer n has the Lehmer property if ϕ(n) divides n − 1, where ϕ is an Euler totient function. In this note we shall prove that if n has the Lehmer property, then n ≤ 2 2 K − 2 2 K−1 , where K is the number of prime divisors of n. We apply this bound to repunit numbers and prove that there are at most finitely many numbers with the Lehmer property in the setwhere ν 2 (g) denotes the highest power of 2 that divides g, and L ≥ 1 is a fixed real number.