Robin's inequality for 11-free integers

Abstract

Let σ(n) denote the sum of divisors function, and let ϒ be Euler’s constant. We prove that if there is an n≥5041 for which σ(n)≥eϒn log log n, then n must be divisible by the eleventh power of some prime.