Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1010111000110000010011 |
3 | 1110022100111211111020122211 |
4 | 2201203221322320300103 |
5 | 2423344120211133021 |
6 | 35340124334012551 |
7 | 2224046612063155 |
oct | 241435172706023 |
9 | 43270454436584 |
10 | 11102120021011 |
11 | 35a0423358198 |
12 | 12b37b9647157 |
13 | 626c052114a6 |
14 | 2a54b9db4ad5 |
15 | 143bd1ab33e1 |
hex | a18e9eb8c13 |
11102120021011 has 16 divisors (see below), whose sum is σ = 11699479088640. Its totient is φ = 10506066539040.
The previous prime is 11102120020997. The next prime is 11102120021051. The reversal of 11102120021011 is 11012002120111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11102120021011 - 29 = 11102120020499 is a prime.
It is a super-3 number, since 3×111021200210113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102120020982 and 11102120021000.
It is not an unprimeable number, because it can be changed into a prime (11102120021051) 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, 330275641 + ... + 330309253.
It is an arithmetic number, because the mean of its divisors is an integer number (731217443040).
Almost surely, 211102120021011 is an apocalyptic number.
11102120021011 is a deficient number, since it is larger than the sum of its proper divisors (597359067629).
11102120021011 is a wasteful number, since it uses less digits than its factorization.
11102120021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52506.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11102120021011 its reverse (11012002120111), we get a palindrome (22114122141122).
The spelling of 11102120021011 in words is "eleven trillion, one hundred two billion, one hundred twenty million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •