Base | Representation |
---|---|
bin | 11101010001110101110… |
… | …011110110101101001101 |
3 | 21010100101012220012201201 |
4 | 131101311303312231031 |
5 | 230431104413102341 |
6 | 4140150525305501 |
7 | 265235522131123 |
oct | 35216563665515 |
9 | 7110335805651 |
10 | 2012021222221 |
11 | 706325587a8a |
12 | 285b39a05291 |
13 | 11796ac1970a |
14 | 6d54d233913 |
15 | 3750d541331 |
hex | 1d475cf6b4d |
2012021222221 has 4 divisors (see below), whose sum is σ = 2012144305500. Its totient is φ = 2011898138944.
The previous prime is 2012021222173. The next prime is 2012021222279. The reversal of 2012021222221 is 1222221202102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 279338675625 + 1732682546596 = 528525^2 + 1316314^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012021222221 - 229 = 2011484351309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012021226221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61517116 + ... + 61549813.
It is an arithmetic number, because the mean of its divisors is an integer number (503036076375).
Almost surely, 22012021222221 is an apocalyptic number.
It is an amenable number.
2012021222221 is a deficient number, since it is larger than the sum of its proper divisors (123083279).
2012021222221 is a wasteful number, since it uses less digits than its factorization.
2012021222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123083278.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 2012021222221 its reverse (1222221202102), we get a palindrome (3234242424323).
The spelling of 2012021222221 in words is "two trillion, twelve billion, twenty-one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •