Base | Representation |
---|---|
bin | 1010001011111011101010… |
… | …1101011001000101110100 |
3 | 1110122201110002001211011011 |
4 | 2202332322231121011310 |
5 | 2432000312210431400 |
6 | 35453132134322004 |
7 | 2234116135633213 |
oct | 242767255310564 |
9 | 43581402054134 |
10 | 11200112202100 |
11 | 3628a39396218 |
12 | 130a7a6ab9304 |
13 | 633220a699b3 |
14 | 2aa13450307a |
15 | 1465198e38ba |
hex | a2fbab59174 |
11200112202100 has 18 divisors (see below), whose sum is σ = 24304243478774. Its totient is φ = 4480044880800.
The previous prime is 11200112202073. The next prime is 11200112202119. The reversal of 11200112202100 is 120221100211.
It can be written as a sum of positive squares in 3 ways, for example, as 2217252033936 + 8982860168164 = 1489044^2 + 2997142^2 .
It is a super-2 number, since 2×112001122021002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56000560911 + ... + 56000561110.
Almost surely, 211200112202100 is an apocalyptic number.
11200112202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11200112202100 is an abundant number, since it is smaller than the sum of its proper divisors (13104131276674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200112202100 is a wasteful number, since it uses less digits than its factorization.
11200112202100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112001122035 (or 112001122028 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11200112202100 its reverse (120221100211), we get a palindrome (11320333302311).
The spelling of 11200112202100 in words is "eleven trillion, two hundred billion, one hundred twelve million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •