Base | Representation |
---|---|
bin | 1010000111010001101011… |
… | …0111100011011101001110 |
3 | 1110101001222100200210221010 |
4 | 2201310122313203131032 |
5 | 2424143002000200420 |
6 | 35352302455350050 |
7 | 2225254652531301 |
oct | 241643267433516 |
9 | 43331870623833 |
10 | 11120121100110 |
11 | 35a8020507370 |
12 | 12b71a2082326 |
13 | 62881372bc99 |
14 | 2a6306a02b38 |
15 | 1443d70d14e0 |
hex | a1d1ade374e |
11120121100110 has 64 divisors (see below), whose sum is σ = 29115121572864. Its totient is φ = 2695729276800.
The previous prime is 11120121100079. The next prime is 11120121100169. The reversal of 11120121100110 is 1100112102111.
It is a super-2 number, since 2×111201211001102 (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 31 ways as a sum of consecutive naturals, for example, 16250907 + ... + 16921353.
It is an arithmetic number, because the mean of its divisors is an integer number (454923774576).
Almost surely, 211120121100110 is an apocalyptic number.
11120121100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120121100110 is an abundant number, since it is smaller than the sum of its proper divisors (17995000472754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120121100110 is a wasteful number, since it uses less digits than its factorization.
11120121100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720729.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11120121100110 its reverse (1100112102111), we get a palindrome (12220233202221).
It can be divided in two parts, 1112012 and 1100110, that added together give a palindrome (2212122).
The spelling of 11120121100110 in words is "eleven trillion, one hundred twenty billion, one hundred twenty-one million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •