Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0111101110111100110 |
3 | 102200011111211221111220 |
4 | 1301231312331313212 |
5 | 4000031131210042 |
6 | 132032030041210 |
7 | 11551543442412 |
oct | 1615566756746 |
9 | 380144757456 |
10 | 122102210022 |
11 | 47868572681 |
12 | 1b7b7949206 |
13 | b68b89a120 |
14 | 5ca4609d42 |
15 | 32998078ec |
hex | 1c6ddbdde6 |
122102210022 has 64 divisors (see below), whose sum is σ = 266708768256. Its totient is φ = 37039023360.
The previous prime is 122102210011. The next prime is 122102210023. The reversal of 122102210022 is 220012201221.
It is a junction number, because it is equal to n+sod(n) for n = 122102209983 and 122102210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102210023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22266493 + ... + 22271975.
It is an arithmetic number, because the mean of its divisors is an integer number (4167324504).
Almost surely, 2122102210022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122102210022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133354384128).
122102210022 is an abundant number, since it is smaller than the sum of its proper divisors (144606558234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122102210022 is a wasteful number, since it uses less digits than its factorization.
122102210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9485.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122102210022 its reverse (220012201221), we get a palindrome (342114411243).
The spelling of 122102210022 in words is "one hundred twenty-two billion, one hundred two million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •