Search a number
-
+
11101101102000 = 2432537136777229
BaseRepresentation
bin1010000110001010110100…
…1100000001001110110000
31110022020212211012210112200
42201202231030001032300
52423340023340231000
635335435255023200
72224012430314620
oct241425514011660
943266784183480
1011101101102000
11359aa50192268
1212b357436ab00
13626aa20abc30
142a5420940880
15143b723e6500
hexa18ad3013b0

11101101102000 has 480 divisors, whose sum is σ = 47719940311680. Its totient is φ = 2342209996800.

The previous prime is 11101101101897. The next prime is 11101101102017. The reversal of 11101101102000 is 20110110111.

It is a super-2 number, since 2×111011011020002 (a number of 27 digits) contains 22 as substring.

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

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 (17) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1750615 + ... + 5026614.

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

Almost surely, 211101101102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11101101102000 its reverse (20110110111), we get a palindrome (11121211212111).

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