Base | Representation |
---|---|
bin | 111000110111001110… |
… | …0011000111000110110 |
3 | 102200012012022100022020 |
4 | 1301232130120320312 |
5 | 4000041134120042 |
6 | 132033020214010 |
7 | 11552023021116 |
oct | 1615634307066 |
9 | 380165270266 |
10 | 122112020022 |
11 | 47873063013 |
12 | 1b7bb09a306 |
13 | b690923365 |
14 | 5ca5a41046 |
15 | 329a5e43ec |
hex | 1c6e718e36 |
122112020022 has 8 divisors (see below), whose sum is σ = 244224040056. Its totient is φ = 40704006672.
The previous prime is 122112019987. The next prime is 122112020027. The reversal of 122112020022 is 220020211221.
It is a sphenic number, since it is the product of 3 distinct primes.
122112020022 is an admirable number.
It is a super-2 number, since 2×1221120200222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122112019983 and 122112020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122112020027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10176001663 + ... + 10176001674.
It is an arithmetic number, because the mean of its divisors is an integer number (30528005007).
Almost surely, 2122112020022 is an apocalyptic number.
122112020022 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.
122112020022 is a wasteful number, since it uses less digits than its factorization.
122112020022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20352003342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122112020022 its reverse (220020211221), we get a palindrome (342132231243).
The spelling of 122112020022 in words is "one hundred twenty-two billion, one hundred twelve million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •