Base | Representation |
---|---|
bin | 1010000000111011011001… |
… | …01001011010011101101110 |
3 | 2212222021221102012222210211 |
4 | 11000131230221122131232 |
5 | 10341302300222402342 |
6 | 114500453342053034 |
7 | 4432021444326133 |
oct | 500355451323556 |
9 | 85867842188724 |
10 | 22022120122222 |
11 | 702058a76a070 |
12 | 257804b57a17a |
13 | c398a553780c |
14 | 561c3a7da58a |
15 | 282ca4cbdc17 |
hex | 14076ca5a76e |
22022120122222 has 32 divisors (see below), whose sum is σ = 36689446056960. Its totient is φ = 9828989617920.
The previous prime is 22022120122217. The next prime is 22022120122259. The reversal of 22022120122222 is 22222102122022.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 22022120122193 and 22022120122202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8709603 + ... + 10949950.
It is an arithmetic number, because the mean of its divisors is an integer number (1146545189280).
Almost surely, 222022120122222 is an apocalyptic number.
22022120122222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22022120122222 is a deficient number, since it is larger than the sum of its proper divisors (14667325934738).
22022120122222 is a wasteful number, since it uses less digits than its factorization.
22022120122222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19660488.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 22022120122222 its reverse (22222102122022), we get a palindrome (44244222244244).
The spelling of 22022120122222 in words is "twenty-two trillion, twenty-two billion, one hundred twenty million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •