Base | Representation |
---|---|
bin | 1010000111011000101011… |
… | …1010110110000110100110 |
3 | 1110101020211101002012000110 |
4 | 2201312022322312012212 |
5 | 2424210324224323420 |
6 | 35353213212353450 |
7 | 2225352360521343 |
oct | 241661272660646 |
9 | 43336741065013 |
10 | 11122001011110 |
11 | 35a88a5691320 |
12 | 12b7627775886 |
13 | 628a5304aa62 |
14 | 2a644455b7ca |
15 | 144497171ee0 |
hex | a1d8aeb61a6 |
11122001011110 has 128 divisors (see below), whose sum is σ = 29175481456128. Its totient is φ = 2691057024000.
The previous prime is 11122001011049. The next prime is 11122001011129. The reversal of 11122001011110 is 1111010022111.
11122001011110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111220010111102 (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 63 ways as a sum of consecutive naturals, for example, 369597165 + ... + 369627255.
It is an arithmetic number, because the mean of its divisors is an integer number (227933448876).
Almost surely, 211122001011110 is an apocalyptic number.
11122001011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11122001011110 is an abundant number, since it is smaller than the sum of its proper divisors (18053480445018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122001011110 is a wasteful number, since it uses less digits than its factorization.
11122001011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32230.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11122001011110 its reverse (1111010022111), we get a palindrome (12233011033221).
The spelling of 11122001011110 in words is "eleven trillion, one hundred twenty-two billion, one million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •