Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …101101111101001011001 |
3 | 21010011110002212122102220 |
4 | 131100003331233221121 |
5 | 230413201432241441 |
6 | 4135233215214253 |
7 | 265140300250425 |
oct | 35200375575131 |
9 | 7104402778386 |
10 | 2010111212121 |
11 | 705535415141 |
12 | 2856a6217389 |
13 | 1177252bc81c |
14 | 6d40b6c1b85 |
15 | 3744aa07466 |
hex | 1d403f6fa59 |
2010111212121 has 8 divisors (see below), whose sum is σ = 2680158026784. Its totient is φ = 1340069269440.
The previous prime is 2010111212089. The next prime is 2010111212129. The reversal of 2010111212121 is 1212121110102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2010111212121 - 25 = 2010111212089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2010111212121.
It is not an unprimeable number, because it can be changed into a prime (2010111212129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111760 + ... + 2008161.
It is an arithmetic number, because the mean of its divisors is an integer number (335019753348).
Almost surely, 22010111212121 is an apocalyptic number.
It is an amenable number.
2010111212121 is a deficient number, since it is larger than the sum of its proper divisors (670046814663).
2010111212121 is a wasteful number, since it uses less digits than its factorization.
2010111212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2435991.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2010111212121 its reverse (1212121110102), we get a palindrome (3222232322223).
The spelling of 2010111212121 in words is "two trillion, ten billion, one hundred eleven million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •