Base | Representation |
---|---|
bin | 11101010010000001101… |
… | …010111001010001001011 |
3 | 21010100220002022022221111 |
4 | 131102001222321101023 |
5 | 230432011332400021 |
6 | 4140222354151151 |
7 | 265243456330240 |
oct | 35220152712113 |
9 | 7110802268844 |
10 | 2012220200011 |
11 | 706417931a3a |
12 | 285b945824b7 |
13 | 1179a0206658 |
14 | 6d56b82b5c7 |
15 | 37520c478e1 |
hex | 1d481ab944b |
2012220200011 has 8 divisors (see below), whose sum is σ = 2299688814080. Its totient is φ = 1724753732328.
The previous prime is 2012220199999. The next prime is 2012220200027. The reversal of 2012220200011 is 1100020222102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012220200011 - 217 = 2012220068939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2012220199964 and 2012220200000.
It is not an unprimeable number, because it can be changed into a prime (2012220203011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3324910 + ... + 3883228.
It is an arithmetic number, because the mean of its divisors is an integer number (287461101760).
Almost surely, 22012220200011 is an apocalyptic number.
2012220200011 is a deficient number, since it is larger than the sum of its proper divisors (287468614069).
2012220200011 is an equidigital number, since it uses as much as digits as its factorization.
2012220200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073193.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2012220200011 its reverse (1100020222102), we get a palindrome (3112240422113).
The spelling of 2012220200011 in words is "two trillion, twelve billion, two hundred twenty million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •