Search a number
-
+
111011121100000 = 255511631115991
BaseRepresentation
bin11001001111011011001010…
…011100000111010011100000
3112120001120002220021121210201
4121033123022130013103200
5104022301234000200000
61032033445514034544
732245201032203632
oct3117331234072340
9476046086247721
10111011121100000
113240a608897120
121054a847a18a54
1349c33c45b5134
141d5ad7737ca52
15cc79c248996a
hex64f6ca7074e0

111011121100000 has 288 divisors, whose sum is σ = 298073801055744. Its totient is φ = 40358760000000.

The previous prime is 111011121099979. The next prime is 111011121100051. The reversal of 111011121100000 is 1121110111.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 111011121100000.

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

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

Almost surely, 2111011121100000 is an apocalyptic number.

111011121100000 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 111011121100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149036900527872).

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

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

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

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

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

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

Adding to 111011121100000 its reverse (1121110111), we get a palindrome (111012242210111).

The spelling of 111011121100000 in words is "one hundred eleven trillion, eleven billion, one hundred twenty-one million, one hundred thousand".