Given a number `N`, find the total number of 1s present in `pow(11, N)` where `1 < N < 1000,000`. Solving this using a basic approach will land us into overflow issues since `N` could be very large. What are some ways that we can solve this efficiently?