Search a number
-
+
111100111112000 = 2653311133964463
BaseRepresentation
bin11001010000101110000010…
…101010000100011101000000
3112120101001210202200121212002
4121100232002222010131000
5104030231011421041000
61032142404134523132
732254501215630023
oct3120560252043500
9476331722617762
10111100111112000
113244432439228a
1210563b425064a8
1349cb9070b0c7a
141d613ba08d1ba
15cc9e7ed108d5
hex650b82a84740

111100111112000 has 224 divisors, whose sum is σ = 286528368881664. Its totient is φ = 42625895424000.

The previous prime is 111100111111967. The next prime is 111100111112069. The reversal of 111100111112000 is 211111001111.

It is a happy number.

111100111112000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26041769 + ... + 30006231.

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

Almost surely, 2111100111112000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 111100111112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143264184440832).

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

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

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

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

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

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

Adding to 111100111112000 its reverse (211111001111), we get a palindrome (111311222113111).

It can be divided in two parts, 111100111 and 112000, that added together give a palindrome (111212111).

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