Search a number
110000101110111 = 344995077753597
BaseRepresentation
bin11001000000101101100100…
…111100111011000101011111
3112102110220111011210201010000
4121000231210330323011133
5103404220201341010421
61025541203202545343
732112150023114322
oct3100554474730537
9472426434721100
10110000101110111
113205a86541a773
121040690b368253
13494bc71213324
141d240675407b9
15cab54d536226
hex640b64f3b15f

110000101110111 has 40 divisors (see below), whose sum is σ = 164656754262000. Its totient is φ = 73183633218432.

The previous prime is 110000101110073. The next prime is 110000101110127. The reversal of 110000101110111 is 111011101000011.

It is not a de Polignac number, because 110000101110111 - 221 = 110000099012959 is a prime.

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 = 110000101110093 and 110000101110102.

It is a congruent number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2052328765 + ... + 2052382361.

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

Almost surely, 2110000101110111 is an apocalyptic number.

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

110000101110111 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 110000101110111 its reverse (111011101000011), we get a palindrome (221011202110122).

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