Base | Representation |
---|---|
bin | 1001001001100110100000… |
… | …10101110101101010010011 |
3 | 2122020120010121020210102222 |
4 | 10210303100111311222103 |
5 | 10114131024240401321 |
6 | 110443303235131255 |
7 | 4144463110522004 |
oct | 444632025655223 |
9 | 78216117223388 |
10 | 20121122200211 |
11 | 6458357a1a84a |
12 | 230b737143b2b |
13 | b2c54bb227a6 |
14 | 4d7c206411ab |
15 | 24d5e360a3ab |
hex | 124cd0575a93 |
20121122200211 has 4 divisors (see below), whose sum is σ = 20122634056800. Its totient is φ = 20119610343624.
The previous prime is 20121122200199. The next prime is 20121122200213. The reversal of 20121122200211 is 11200222112102.
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 20121122200211 - 26 = 20121122200147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20121122200211.
It is not an unprimeable number, because it can be changed into a prime (20121122200213) 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, 755908331 + ... + 755934948.
It is an arithmetic number, because the mean of its divisors is an integer number (5030658514200).
Almost surely, 220121122200211 is an apocalyptic number.
20121122200211 is a deficient number, since it is larger than the sum of its proper divisors (1511856589).
20121122200211 is a wasteful number, since it uses less digits than its factorization.
20121122200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1511856588.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20121122200211 its reverse (11200222112102), we get a palindrome (31321344312313).
The spelling of 20121122200211 in words is "twenty trillion, one hundred twenty-one billion, one hundred twenty-two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •