Base | Representation |
---|---|
bin | 1010000000011001101101… |
… | …1111101100011101111101 |
3 | 1102221210010200200102202021 |
4 | 2200012123133230131331 |
5 | 2420224114111202031 |
6 | 35222131435400141 |
7 | 2213604212115601 |
oct | 240063337543575 |
9 | 42853120612667 |
10 | 11002020022141 |
11 | 3561a265314a5 |
12 | 12983222b3051 |
13 | 61a641a8b925 |
14 | 2a0701963501 |
15 | 1412c3bc4511 |
hex | a019b7ec77d |
11002020022141 has 2 divisors, whose sum is σ = 11002020022142. Its totient is φ = 11002020022140.
The previous prime is 11002020022129. The next prime is 11002020022157. The reversal of 11002020022141 is 14122002020011.
It is an a-pointer prime, because the next prime (11002020022157) can be obtained adding 11002020022141 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9779248498041 + 1222771524100 = 3127179^2 + 1105790^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002020022141 - 225 = 11001986467709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002020022181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501010011070 + 5501010011071.
It is an arithmetic number, because the mean of its divisors is an integer number (5501010011071).
Almost surely, 211002020022141 is an apocalyptic number.
It is an amenable number.
11002020022141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002020022141 is an equidigital number, since it uses as much as digits as its factorization.
11002020022141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11002020022141 its reverse (14122002020011), we get a palindrome (25124022042152).
The spelling of 11002020022141 in words is "eleven trillion, two billion, twenty million, twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •