Base | Representation |
---|---|
bin | 11011110010010001100100… |
… | …110100111111110000001011 |
3 | 121000200101222112112112012121 |
4 | 123302101210310333300023 |
5 | 112004124400341320021 |
6 | 1111522511550152111 |
7 | 34511544661646443 |
oct | 3362214464776013 |
9 | 530611875475177 |
10 | 122202101120011 |
11 | 35a34690309810 |
12 | 118577044b2637 |
13 | 53257bb3a0a93 |
14 | 2226882a9d123 |
15 | e1db55291741 |
hex | 6f2464d3fc0b |
122202101120011 has 8 divisors (see below), whose sum is σ = 133311463990848. Its totient is φ = 111092751741000.
The previous prime is 122202101119997. The next prime is 122202101120081. The reversal of 122202101120011 is 110021101202221.
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 122202101120011 - 229 = 122201564249099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122202101120081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29467956 + ... + 33358126.
It is an arithmetic number, because the mean of its divisors is an integer number (16663932998856).
Almost surely, 2122202101120011 is an apocalyptic number.
122202101120011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122202101120011 is a deficient number, since it is larger than the sum of its proper divisors (11109362870837).
122202101120011 is a wasteful number, since it uses less digits than its factorization.
122202101120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6745913.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122202101120011 its reverse (110021101202221), we get a palindrome (232223202322232).
The spelling of 122202101120011 in words is "one hundred twenty-two trillion, two hundred two billion, one hundred one million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •