Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …1100111101011101100000 |
3 | 1110022021010212002120001002 |
4 | 2201202303030331131200 |
5 | 2423340230203341000 |
6 | 35335453301531132 |
7 | 2224015064120102 |
oct | 241426314753540 |
9 | 43267125076032 |
10 | 11101202012000 |
11 | 359aaa2145461 |
12 | 12b35a2113aa8 |
13 | 626ab9c809a9 |
14 | 2a54300cb572 |
15 | 143b7b1ca8d5 |
hex | a18b333d760 |
11101202012000 has 96 divisors (see below), whose sum is σ = 27331665641280. Its totient is φ = 4431361996800.
The previous prime is 11101202011927. The next prime is 11101202012009. The reversal of 11101202012000 is 21020210111.
It is a super-2 number, since 2×111012020120002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101202012009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 901385 + ... + 4797384.
It is an arithmetic number, because the mean of its divisors is an integer number (284704850430).
Almost surely, 211101202012000 is an apocalyptic number.
11101202012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101202012000 is an abundant number, since it is smaller than the sum of its proper divisors (16230463629280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101202012000 is an equidigital number, since it uses as much as digits as its factorization.
11101202012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5699281 (or 5699263 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11101202012000 its reverse (21020210111), we get a palindrome (11122222222111).
The spelling of 11101202012000 in words is "eleven trillion, one hundred one billion, two hundred two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •