Search a number
-
+
11001100200012 = 2236131511921889
BaseRepresentation
bin1010000000010110010010…
…1010110110100001001100
31102221200202120212122000000
42200011210222312201030
52420220223122400022
635221500300404300
72213542342551456
oct240054452664114
942850676778000
1011001100200012
1135615a42a051a
121298106246690
1361a526344a90
142a06557272d6
1514126d07e6ac
hexa0164ab684c

11001100200012 has 168 divisors, whose sum is σ = 31290921469920. Its totient is φ = 3362535244800.

The previous prime is 11001100200007. The next prime is 11001100200037. The reversal of 11001100200012 is 21000200110011.

It is a happy number.

It is a super-2 number, since 2×110011002000122 (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 junction number, because it is equal to n+sod(n) for n = 11001100199967 and 11001100200003.

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

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

Almost surely, 211001100200012 is an apocalyptic number.

11001100200012 is a gapful number since it is divisible by the number (12) 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 11001100200012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15645460734960).

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

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

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

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

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

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

Adding to 11001100200012 its reverse (21000200110011), we get a palindrome (32001300310023).

Subtracting 11001100200012 from its reverse (21000200110011), we obtain a palindrome (9999099909999).

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