Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …001101111010001011111 |
3 | 21010011011102200212212200 |
4 | 131033331121233101133 |
5 | 230412440241010421 |
6 | 4135214243302543 |
7 | 265134462352341 |
oct | 35177531572137 |
9 | 7104142625780 |
10 | 2010001110111 |
11 | 705489253945 |
12 | 28567537aa53 |
13 | 11770854cbc7 |
14 | 6d3dac21291 |
15 | 37441009726 |
hex | 1d3fd66f45f |
2010001110111 has 12 divisors (see below), whose sum is σ = 2904302431680. Its totient is φ = 1339554204000.
The previous prime is 2010001110077. The next prime is 2010001110119. The reversal of 2010001110111 is 1110111000102.
It is not a de Polignac number, because 2010001110111 - 213 = 2010001101919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2010001110093 and 2010001110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010001110119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 37182831 + ... + 37236848.
It is an arithmetic number, because the mean of its divisors is an integer number (242025202640).
Almost surely, 22010001110111 is an apocalyptic number.
2010001110111 is a deficient number, since it is larger than the sum of its proper divisors (894301321569).
2010001110111 is a wasteful number, since it uses less digits than its factorization.
2010001110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74422686 (or 74422683 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2010001110111 its reverse (1110111000102), we get a palindrome (3120112110213).
The spelling of 2010001110111 in words is "two trillion, ten billion, one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •