Base | Representation |
---|---|
bin | 11011110000110100011100… |
… | …010011000000010011100110 |
3 | 121000022211212021210101100220 |
4 | 123300310130103000103212 |
5 | 112001010100100031042 |
6 | 1111404532543145210 |
7 | 34501404602323500 |
oct | 3360643423002346 |
9 | 530284767711326 |
10 | 122102100002022 |
11 | 359a623428a758 |
12 | 118402562a5206 |
13 | 531924258c50a |
14 | 2221ab782ad70 |
15 | e1b250dd58ec |
hex | 6f0d1c4c04e6 |
122102100002022 has 24 divisors (see below), whose sum is σ = 284074273474776. Its totient is φ = 34886314286208.
The previous prime is 122102100001969. The next prime is 122102100002093. The reversal of 122102100002022 is 220200001201221.
122102100002022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 122102100001992 and 122102100002010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 207656632363 + ... + 207656632950.
It is an arithmetic number, because the mean of its divisors is an integer number (11836428061449).
Almost surely, 2122102100002022 is an apocalyptic number.
122102100002022 is an abundant number, since it is smaller than the sum of its proper divisors (161972173472754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122102100002022 is a wasteful number, since it uses less digits than its factorization.
122102100002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415313265332 (or 415313265325 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122102100002022 its reverse (220200001201221), we get a palindrome (342302101203243).
The spelling of 122102100002022 in words is "one hundred twenty-two trillion, one hundred two billion, one hundred million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •