We know the limit is not 100 because of Euclid's proof of the infinitude of primes.
That doesn't mean there's an n with 100%, just that there's no smaller limit that some n doesn't exceed.
Iirc, it is believed that the number of primes less than n is O(n/log(n)), so primes/integers among the first n integers should go as O(1/log(n)), so goes to 0 as n goes to infinity.
So, I wasn't sure if it had been proven, or just proven given that assumption. So that's why I said that it was believed.