5111011115 has 32 divisors (see below), whose sum is σ = 7409149440. Its totient is φ = 3306355200.

The previous prime is 5111011109. The next prime is 5111011133. The reversal of 5111011115 is 5111101115.

It is not a de Polignac number, because 5111011115 - 2⁸ = 5111010859 is a prime.

It is a super-2 number, since 2×5111011115² = 52244869235307086450, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 5111011093 and 5111011102.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 144320 + ... + 176210.

It is an arithmetic number, because the mean of its divisors is an integer number (231535920).

Almost surely, 2^5111011115 is an apocalyptic number.

5111011115 is a deficient number, since it is larger than the sum of its proper divisors (2298138325).

5111011115 is a wasteful number, since it uses less digits than its factorization.

5111011115 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 32163.

The product of its (nonzero) digits is 25, while the sum is 17.

The square root of 5111011115 is about 71491.3359435953. The cubic root of 5111011115 is about 1722.5385171314.

Subtracting 5111011115 from its reverse (5111101115), we obtain a square (90000 = 300²).

The spelling of 5111011115 in words is "five billion, one hundred eleven million, eleven thousand, one hundred fifteen".