Summation – Variation of the total function.

In the totient function, it enumerates the number of smaller positive integers that $ n $ which are coprime for $ n $. Is there a way to calculate the number of positive integers less than n that are coprime to any positive integer n or less? For a specific number like 1000, how would this be achieved? I think this would yield. $ sum_ {n = 1} ^ {1000} phi (n) $.