Base | Representation |
---|---|
bin | 11110111000011101000… |
… | …110001101100101101011 |
3 | 21111212202220111021001221 |
4 | 132320131012031211223 |
5 | 234232232203341021 |
6 | 4302532014122511 |
7 | 306216100316404 |
oct | 36703506154553 |
9 | 7455686437057 |
10 | 2122202012011 |
11 | 74902578a144 |
12 | 2a33691b0437 |
13 | 125179a05b13 |
14 | 74a024389ab |
15 | 3a30b44b241 |
hex | 1ee1d18d96b |
2122202012011 has 4 divisors (see below), whose sum is σ = 2122347452632. Its totient is φ = 2122056571392.
The previous prime is 2122202011997. The next prime is 2122202012023. The reversal of 2122202012011 is 1102102022212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2122202012011 - 231 = 2120054528363 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2122202012911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72698421 + ... + 72727606.
It is an arithmetic number, because the mean of its divisors is an integer number (530586863158).
Almost surely, 22122202012011 is an apocalyptic number.
2122202012011 is a deficient number, since it is larger than the sum of its proper divisors (145440621).
2122202012011 is a wasteful number, since it uses less digits than its factorization.
2122202012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145440620.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2122202012011 its reverse (1102102022212), we get a palindrome (3224304034223).
It can be divided in two parts, 212220201 and 2011, that added together give a palindrome (212222212).
The spelling of 2122202012011 in words is "two trillion, one hundred twenty-two billion, two hundred two million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •