Search a number
BaseRepresentation
bin110011101100000011…
…1110010000011111000
3101121111210021101012000
41213120013302003320
53304312011213422
6122554233221000
711006454202065
oct1473007620370
9347453241160
10111000101112
114309073295a
1219619861760
13a60c771104
14552dd59c6c
152d49ce8cac
hex19d81f20f8

111000101112 has 32 divisors (see below), whose sum is σ = 308333614800. Its totient is φ = 37000033632.

The previous prime is 111000101111. The next prime is 111000101117. The reversal of 111000101112 is 211101000111.

Adding to 111000101112 its reverse (211101000111), we get a palindrome (322101101223).

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 = 111000101094 and 111000101103.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 256944463 + ... + 256944894.

Almost surely, 2111000101112 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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