Base | Representation |
---|---|
bin | 1001001001101000100011… |
… | …10010011101011001000110 |
3 | 2122020122222010101002012110 |
4 | 10210310101302131121012 |
5 | 10114140301334101042 |
6 | 110444004221401450 |
7 | 4144532242535532 |
oct | 444642162353106 |
9 | 78218863332173 |
10 | 20122220222022 |
11 | 6458870803896 |
12 | 230b9a2a09286 |
13 | b2c69545cc39 |
14 | 4d7cc63c6bc2 |
15 | 24d659c0009c |
hex | 124d11c9d646 |
20122220222022 has 32 divisors (see below), whose sum is σ = 40344680476800. Its totient is φ = 6690703396608.
The previous prime is 20122220222021. The next prime is 20122220222059. The reversal of 20122220222022 is 22022202222102.
It is a super-2 number, since 2×201222202220222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20122220222022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122220222021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24072918 + ... + 24894774.
It is an arithmetic number, because the mean of its divisors is an integer number (1260771264900).
Almost surely, 220122220222022 is an apocalyptic number.
20122220222022 is an abundant number, since it is smaller than the sum of its proper divisors (20222460254778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122220222022 is a wasteful number, since it uses less digits than its factorization.
20122220222022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 832020.
The product of its (nonzero) digits is 1024, while the sum is 21.
Adding to 20122220222022 its reverse (22022202222102), we get a palindrome (42144422444124).
The spelling of 20122220222022 in words is "twenty trillion, one hundred twenty-two billion, two hundred twenty million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •