Base | Representation |
---|---|
bin | 11011110010011010000011… |
… | …010010100001101000010110 |
3 | 121000201021110210122211012210 |
4 | 123302122003102201220112 |
5 | 112004302020220041042 |
6 | 1111531015020054250 |
7 | 34512316342054032 |
oct | 3362320322415026 |
9 | 530637423584183 |
10 | 122211202112022 |
11 | 35a38530609811 |
12 | 11859424394386 |
13 | 532660ba5125a |
14 | 22270a76831c2 |
15 | e1ded926ba9c |
hex | 6f26834a1a16 |
122211202112022 has 8 divisors (see below), whose sum is σ = 244422404224056. Its totient is φ = 40737067370672.
The previous prime is 122211202111993. The next prime is 122211202112119. The reversal of 122211202112022 is 220211202112221.
It is a sphenic number, since it is the product of 3 distinct primes.
122211202112022 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 122211202112022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10184266842663 + ... + 10184266842674.
It is an arithmetic number, because the mean of its divisors is an integer number (30552800528007).
Almost surely, 2122211202112022 is an apocalyptic number.
122211202112022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122211202112022 is a wasteful number, since it uses less digits than its factorization.
122211202112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20368533685342.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 122211202112022 its reverse (220211202112221), we get a palindrome (342422404224243).
The spelling of 122211202112022 in words is "one hundred twenty-two trillion, two hundred eleven billion, two hundred two million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •