110101110111122 has 64 divisors (see below), whose sum is σ = 186866966200320. Its totient is φ = 48301146504000.

The previous prime is 110101110111121. The next prime is 110101110111137. The reversal of 110101110111122 is 221111011101011.

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

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

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

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

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

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

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

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

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

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

The sum of its prime factors is 2012799.

The product of its (nonzero) digits is 4, while the sum is 14.

Adding to 110101110111122 its reverse (221111011101011), we get a palindrome (331212121212133).

The spelling of 110101110111122 in words is "one hundred ten trillion, one hundred one billion, one hundred ten million, one hundred eleven thousand, one hundred twenty-two".