1011110211112 has 16 divisors (see below), whose sum is σ = 1895871703860. Its totient is φ = 505544423424.

The previous prime is 1011110211103. The next prime is 1011110211143. The reversal of 1011110211112 is 2111120111101.

It can be written as a sum of positive squares in 2 ways, for example, as 856650206916 + 154460004196 = 925554^2 + 393014^2 .

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

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 925593 + ... + 1696744.

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

It is an amenable number.

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

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

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

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

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

Adding to 1011110211112 its reverse (2111120111101), we get a palindrome (3122230322213).

The spelling of 1011110211112 in words is "one trillion, eleven billion, one hundred ten million, two hundred eleven thousand, one hundred twelve".