Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …01000111010010001000100 |
3 | 2122121012111222000201002020 |
4 | 10212101031020322101010 |
5 | 10122304124023223022 |
6 | 111001505245043140 |
7 | 4154664005463525 |
oct | 446211510722104 |
9 | 78535458021066 |
10 | 20222000211012 |
11 | 6497113a29406 |
12 | 23271aab564b0 |
13 | b38c074c9c42 |
14 | 4dca7013684c |
15 | 25104997b35c |
hex | 12644d23a444 |
20222000211012 has 24 divisors (see below), whose sum is σ = 48706753197312. Its totient is φ = 6523225874400.
The previous prime is 20222000210999. The next prime is 20222000211019. The reversal of 20222000211012 is 21011200022202.
It is a junction number, because it is equal to n+sod(n) for n = 20222000210982 and 20222000211000.
It is not an unprimeable number, because it can be changed into a prime (20222000211019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27180107439 + ... + 27180108182.
It is an arithmetic number, because the mean of its divisors is an integer number (2029448049888).
Almost surely, 220222000211012 is an apocalyptic number.
It is an amenable number.
20222000211012 is an abundant number, since it is smaller than the sum of its proper divisors (28484752986300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20222000211012 is a wasteful number, since it uses less digits than its factorization.
20222000211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54360215659 (or 54360215657 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20222000211012 its reverse (21011200022202), we get a palindrome (41233200233214).
The spelling of 20222000211012 in words is "twenty trillion, two hundred twenty-two billion, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •