Search a number
-
+
111101010000000 = 2735737101991
BaseRepresentation
bin11001010000101110111000…
…001111000011100010000000
3112120101011010102002212101020
4121100232320033003202000
5104030234332030000000
61032143033245105440
732254532412224526
oct3120567017034200
9476334112085336
10111101010000000
1132444745825129
1210564153558280
1349cba1b3a8467
141d614635da316
15cc9ed3bbcba0
hex650bb83c3880

111101010000000 has 1024 divisors, whose sum is σ = 382996269527040. Its totient is φ = 28512000000000.

The previous prime is 111101009999999. The next prime is 111101010000049. The reversal of 111101010000000 is 10101111.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 112109999505 + ... + 112110000495.

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

Almost surely, 2111101010000000 is an apocalyptic number.

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

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

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

111101010000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 111101010000000 its reverse (10101111), we get a palindrome (111101020101111).

The spelling of 111101010000000 in words is "one hundred eleven trillion, one hundred one billion, ten million", and thus it is an aban number.