Base | Representation |
---|---|
bin | 11110111000010111100… |
… | …111100110100111111100 |
3 | 21111212112111112202020220 |
4 | 132320113213212213330 |
5 | 234232040141231022 |
6 | 4302514532141340 |
7 | 306213603150255 |
oct | 36702747464774 |
9 | 7455474482226 |
10 | 2122110102012 |
11 | 748a8891386a |
12 | 2a3342467850 |
13 | 1251639656c4 |
14 | 749d4151b2c |
15 | 3a30334385c |
hex | 1ee179e69fc |
2122110102012 has 12 divisors (see below), whose sum is σ = 4951590238056. Its totient is φ = 707370034000.
The previous prime is 2122110101999. The next prime is 2122110102037. The reversal of 2122110102012 is 2102010112212.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×21221101020122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2122110101982 and 2122110102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88421254239 + ... + 88421254262.
It is an arithmetic number, because the mean of its divisors is an integer number (412632519838).
Almost surely, 22122110102012 is an apocalyptic number.
It is an amenable number.
2122110102012 is an abundant number, since it is smaller than the sum of its proper divisors (2829480136044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122110102012 is a wasteful number, since it uses less digits than its factorization.
2122110102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176842508508 (or 176842508506 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2122110102012 its reverse (2102010112212), we get a palindrome (4224120214224).
The spelling of 2122110102012 in words is "two trillion, one hundred twenty-two billion, one hundred ten million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •