Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …100101100001111100100 |
3 | 21110210220000000121222020 |
4 | 132232002010230033210 |
5 | 234041322332211322 |
6 | 4253441332303140 |
7 | 305341553136162 |
oct | 36560204541744 |
9 | 7423800017866 |
10 | 2111011210212 |
11 | 744302881113 |
12 | 2a1165471ab0 |
13 | 1240b53c4ac8 |
14 | 7426009c232 |
15 | 39da3c6d05c |
hex | 1eb8212c3e4 |
2111011210212 has 12 divisors (see below), whose sum is σ = 4925692823856. Its totient is φ = 703670403400.
The previous prime is 2111011210129. The next prime is 2111011210279. The reversal of 2111011210212 is 2120121101112.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 2111011210191 and 2111011210200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87958800414 + ... + 87958800437.
It is an arithmetic number, because the mean of its divisors is an integer number (410474401988).
Almost surely, 22111011210212 is an apocalyptic number.
It is an amenable number.
2111011210212 is an abundant number, since it is smaller than the sum of its proper divisors (2814681613644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111011210212 is a wasteful number, since it uses less digits than its factorization.
2111011210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175917600858 (or 175917600856 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2111011210212 its reverse (2120121101112), we get a palindrome (4231132311324).
The spelling of 2111011210212 in words is "two trillion, one hundred eleven billion, eleven million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •