Abstract
Robin criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n)5040$, where $\sigma(n)$ is the sum-of-divisors function of $n$ and $\gamma\approx0.57721$ is the Euler-Mascheroni constant. Let $q_{1}=2,q_{2}=3,\ldots,q_{m}$ denote the first $m$ consecutive primes, then an integer of the form $\prod_{i=1}^{m}q_{i}^{a_{i}}$ with $a_{1} \geq a_{2} \geq \cdots \geq a_{m} \geq 0$ is called an Hardy-Ramanujan integer. If the Riemann hypothesis is false, then there are infinitely many Hardy-Ramanujan integers $n>5040$ such that Robin inequality does not hold and we prove that $n^{\left(1-\frac{0.6253}{\log q_{m}}\right)}



![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png)