110100111111112 has 16 divisors (see below), whose sum is σ = 206465127453900. Its totient is φ = 55042743790080.

The previous prime is 110100111111061. The next prime is 110100111111119. The reversal of 110100111111112 is 211111111001011.

It can be written as a sum of positive squares in 2 ways, for example, as 108366975722916 + 1733135388196 = 10409946^2 + 1316486^2 .

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

It is not an unprimeable number, because it can be changed into a prime (110100111111119) 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 3 ways as a sum of consecutive naturals, for example, 913906689 + ... + 914027152.

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

It is an amenable number.

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

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

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

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

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

Adding to 110100111111112 its reverse (211111111001011), we get a palindrome (321211222112123).

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