Base | Representation |
---|---|
bin | 1010000111010101101100… |
… | …1111111000101000000100 |
3 | 1110101011202122010121000012 |
4 | 2201311123033320220010 |
5 | 2424202210003020400 |
6 | 35353002002205352 |
7 | 2225323506435206 |
oct | 241653317705004 |
9 | 43334678117005 |
10 | 11121201220100 |
11 | 35a8525183514 |
12 | 12b7443953858 |
13 | 62895643c03a |
14 | 2a63aa248776 |
15 | 14444bd3bd35 |
hex | a1d5b3f8a04 |
11121201220100 has 36 divisors (see below), whose sum is σ = 24528629720868. Its totient is φ = 4375554576000.
The previous prime is 11121201220099. The next prime is 11121201220111. The reversal of 11121201220100 is 102210212111.
It can be written as a sum of positive squares in 6 ways, for example, as 2399326648576 + 8721874571524 = 1548976^2 + 2953282^2 .
It is a super-2 number, since 2×111212012201002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 911567771 + ... + 911579970.
Almost surely, 211121201220100 is an apocalyptic number.
11121201220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11121201220100 is an abundant number, since it is smaller than the sum of its proper divisors (13407428500768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121201220100 is a wasteful number, since it uses less digits than its factorization.
11121201220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1823147816 (or 1823147809 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11121201220100 its reverse (102210212111), we get a palindrome (11223411432211).
The spelling of 11121201220100 in words is "eleven trillion, one hundred twenty-one billion, two hundred one million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •