Search a number
-
+
111100101111102 = 2320177917712421
BaseRepresentation
bin11001010000101110000010…
…000011111010110100111110
3112120101001210001212112012110
4121100232002003322310332
5104030231001341023402
61032142403140314450
732254501034624625
oct3120560203726476
9476331701775173
10111100101111102
1132444319781484
1210563b3b0a2a26
1349cb904cbbb8c
141d613b8a086bc
15cc9e7ded756c
hex650b820fad3e

111100101111102 has 16 divisors (see below), whose sum is σ = 222211215013392. Its totient is φ = 37031531571840.

The previous prime is 111100101111061. The next prime is 111100101111133. The reversal of 111100101111102 is 201111101001111.

It is a congruent number.

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

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

Almost surely, 2111100101111102 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 917732603.

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

Adding to 111100101111102 its reverse (201111101001111), we get a palindrome (312211202112213).

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

Divisors: 1 2 3 6 20177 40354 60531 121062 917712421 1835424842 2753137263 5506274526 18516683518517 37033367037034 55550050555551 111100101111102