Base | Representation |
---|---|
bin | 11011110010100100010100… |
… | …000100101101010111111110 |
3 | 121000202022220201212110220020 |
4 | 123302210110010231113332 |
5 | 112004442102101333042 |
6 | 1111540040243433010 |
7 | 34513156402100511 |
oct | 3362442404552776 |
9 | 530668821773806 |
10 | 122222221121022 |
11 | 35a42175550320 |
12 | 1185b59a685766 |
13 | 53276768a2c19 |
14 | 2227830ca0d78 |
15 | e1e4318133ec |
hex | 6f291412d5fe |
122222221121022 has 16 divisors (see below), whose sum is σ = 266666664264192. Its totient is φ = 37037036703320.
The previous prime is 122222221121009. The next prime is 122222221121027. The reversal of 122222221121022 is 220121122222221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 122222221120983 and 122222221121001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122222221121027) 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, 925925917518 + ... + 925925917649.
It is an arithmetic number, because the mean of its divisors is an integer number (16666666516512).
Almost surely, 2122222221121022 is an apocalyptic number.
122222221121022 is an abundant number, since it is smaller than the sum of its proper divisors (144444443143170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122222221121022 is a wasteful number, since it uses less digits than its factorization.
122222221121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851851835183.
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 122222221121022 its reverse (220121122222221), we get a palindrome (342343343343243).
The spelling of 122222221121022 in words is "one hundred twenty-two trillion, two hundred twenty-two billion, two hundred twenty-one million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •