110111201123 has 32 divisors (see below), whose sum is σ = 139113262080. Its totient is φ = 84660111360.

The previous prime is 110111201119. The next prime is 110111201129. The reversal of 110111201123 is 321102111011.

It is not a de Polignac number, because 110111201123 - 2² = 110111201119 is a prime.

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

It is a Duffinian number.

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

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

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

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

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

Almost surely, 2^110111201123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 33587.

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

Adding to 110111201123 its reverse (321102111011), we get a palindrome (431213312134).

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