1101000011112 has 48 divisors (see below), whose sum is σ = 3157279447140. Its totient is φ = 345411767808.

The previous prime is 1101000011093. The next prime is 1101000011113. The reversal of 1101000011112 is 2111100001011.

It can be written as a sum of positive squares in 2 ways, for example, as 1100749295556 + 250715556 = 1049166^2 + 15834^2 .

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

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 449753683 + ... + 449756130.

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

1101000011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

1101000011112 is an abundant number, since it is smaller than the sum of its proper divisors (2056279436028).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 1101000011112 its reverse (2111100001011), we get a palindrome (3212100012123).

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