111540653051 has 2 divisors, whose sum is σ = 111540653052. Its totient is φ = 111540653050.

The previous prime is 111540653047. The next prime is 111540653057. The reversal of 111540653051 is 150356045111.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 111540653051 - 2² = 111540653047 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (111540653057) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55770326525 + 55770326526.

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

Almost surely, 2^111540653051 is an apocalyptic number.

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

111540653051 is an equidigital number, since it uses as much as digits as its factorization.

111540653051 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 9000, while the sum is 32.

Adding to 111540653051 its reverse (150356045111), we get a palindrome (261896698162).

The spelling of 111540653051 in words is "one hundred eleven billion, five hundred forty million, six hundred fifty-three thousand, fifty-one".