Search a number
-
+
11102002210112 = 2611173146916379
BaseRepresentation
bin1010000110001110001011…
…1001011110010101000000
31110022100012121210211111012
42201203202321132111000
52423343400031210422
635340104524540052
72224043651520152
oct241434271362500
943270177724435
1011102002210112
1135a0372901110
1212b37860b1628
13626bb69a2ab8
142a54a84a8ad2
15143bc65914e2
hexa18e2e5e540

11102002210112 has 224 divisors, whose sum is σ = 26277626327040. Its totient is φ = 4594609152000.

The previous prime is 11102002210111. The next prime is 11102002210153. The reversal of 11102002210112 is 21101220020111.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11102002210111) by changing a digit.

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 31 ways as a sum of consecutive naturals, for example, 1740395339 + ... + 1740401717.

Almost surely, 211102002210112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 11102002210112 its reverse (21101220020111), we get a palindrome (32203222230223).

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