111556656510061 has 32 divisors (see below), whose sum is σ = 133433026272000. Its totient is φ = 93172474402560.

The previous prime is 111556656510037. The next prime is 111556656510107. The reversal of 111556656510061 is 160015656655111.

It is not a de Polignac number, because 111556656510061 - 2⁵ = 111556656510029 is a prime.

It is a super-2 number, since 2×111556656510061² (a number of 29 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (49).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (111556656510011) by changing a digit.

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

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

Almost surely, 2^{111556656510061} is an apocalyptic number.

It is an amenable number.

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

111556656510061 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 9806354 (or 9806340 counting only the distinct ones).

The product of its (nonzero) digits is 810000, while the sum is 49.

The spelling of 111556656510061 in words is "one hundred eleven trillion, five hundred fifty-six billion, six hundred fifty-six million, five hundred ten thousand, sixty-one".