Base | Representation |
---|---|
bin | 11011101111011110110111… |
… | …111000011110010000110110 |
3 | 121000000001201002021002112100 |
4 | 123233132313320132100312 |
5 | 111443003413034341042 |
6 | 1111254415521402530 |
7 | 34461643005644130 |
oct | 3357366770362066 |
9 | 530001632232470 |
10 | 122010221012022 |
11 | 35970275a63672 |
12 | 11826494199446 |
13 | 531068c3b1745 |
14 | 221b47d174050 |
15 | e18b74aeb24c |
hex | 6ef7b7e1e436 |
122010221012022 has 48 divisors (see below), whose sum is σ = 315256223243520. Its totient is φ = 33344408226096.
The previous prime is 122010221012011. The next prime is 122010221012047. The reversal of 122010221012022 is 220210122010221.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 122010221011986 and 122010221012004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21050759872 + ... + 21050765667.
It is an arithmetic number, because the mean of its divisors is an integer number (6567837984240).
Almost surely, 2122010221012022 is an apocalyptic number.
122010221012022 is an abundant number, since it is smaller than the sum of its proper divisors (193246002231498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122010221012022 is a wasteful number, since it uses less digits than its factorization.
122010221012022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42101525577 (or 42101525574 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 122010221012022 its reverse (220210122010221), we get a palindrome (342220343022243).
The spelling of 122010221012022 in words is "one hundred twenty-two trillion, ten billion, two hundred twenty-one million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •