Base | Representation |
---|---|
bin | 1010000000011001101110… |
… | …0011100000010111000001 |
3 | 1102221210010202120012002112 |
4 | 2200012123203200113001 |
5 | 2420224114340133441 |
6 | 35222131513025105 |
7 | 2213604223446224 |
oct | 240063343402701 |
9 | 42853122505075 |
10 | 11002021021121 |
11 | 3561a27053aa9 |
12 | 12983226b5195 |
13 | 61a64204b540 |
14 | 2a0701b435bb |
15 | 1412c3d204eb |
hex | a019b8e05c1 |
11002021021121 has 16 divisors (see below), whose sum is σ = 12106927502208. Its totient is φ = 9936240787200.
The previous prime is 11002021021111. The next prime is 11002021021171. The reversal of 11002021021121 is 12112012020011.
It is not a de Polignac number, because 11002021021121 - 210 = 11002021020097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11002021021096 and 11002021021105.
It is not an unprimeable number, because it can be changed into a prime (11002021021111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45374696 + ... + 45616521.
It is an arithmetic number, because the mean of its divisors is an integer number (756682968888).
Almost surely, 211002021021121 is an apocalyptic number.
It is an amenable number.
11002021021121 is a deficient number, since it is larger than the sum of its proper divisors (1104906481087).
11002021021121 is a wasteful number, since it uses less digits than its factorization.
11002021021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90991432.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11002021021121 its reverse (12112012020011), we get a palindrome (23114033041132).
The spelling of 11002021021121 in words is "eleven trillion, two billion, twenty-one million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •