Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …111110101011111101110 |
3 | 21111212020220110102201120 |
4 | 132320101013311133232 |
5 | 234231324241023042 |
6 | 4302500040121410 |
7 | 306211110560262 |
oct | 36702107653756 |
9 | 7455226412646 |
10 | 2122001111022 |
11 | 748a32341271 |
12 | 2a3311a66266 |
13 | 1251471c46b0 |
14 | 749c38a00a2 |
15 | 3a2e89b4dec |
hex | 1ee111f57ee |
2122001111022 has 96 divisors (see below), whose sum is σ = 4898101132512. Its totient is φ = 609077231616.
The previous prime is 2122001111017. The next prime is 2122001111063. The reversal of 2122001111022 is 2201111002212.
It is a junction number, because it is equal to n+sod(n) for n = 2122001110992 and 2122001111010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2130718 + ... + 2963774.
It is an arithmetic number, because the mean of its divisors is an integer number (51021886797).
Almost surely, 22122001111022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2122001111022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2449050566256).
2122001111022 is an abundant number, since it is smaller than the sum of its proper divisors (2776100021490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122001111022 is a wasteful number, since it uses less digits than its factorization.
2122001111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833222 (or 833205 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2122001111022 its reverse (2201111002212), we get a palindrome (4323112113234).
The spelling of 2122001111022 in words is "two trillion, one hundred twenty-two billion, one million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •