Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …100000100110001111101 |
3 | 21010011012001122011220200 |
4 | 131033331330010301331 |
5 | 230413000042023401 |
6 | 4135215204234113 |
7 | 265134632021316 |
oct | 35177574046175 |
9 | 7104161564820 |
10 | 2010010111101 |
11 | 705493341483 |
12 | 28567839b939 |
13 | 11770a381b35 |
14 | 6d3dc0c560d |
15 | 37441bd6686 |
hex | 1d3fdf04c7d |
2010010111101 has 12 divisors (see below), whose sum is σ = 2904426082428. Its totient is φ = 1339509135744.
The previous prime is 2010010111099. The next prime is 2010010111121. The reversal of 2010010111101 is 1011110100102.
It can be written as a sum of positive squares in 2 ways, for example, as 349429947876 + 1660580163225 = 591126^2 + 1288635^2 .
It is not a de Polignac number, because 2010010111101 - 21 = 2010010111099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010010111121) 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, 41441500 + ... + 41489973.
It is an arithmetic number, because the mean of its divisors is an integer number (242035506869).
Almost surely, 22010010111101 is an apocalyptic number.
It is an amenable number.
2010010111101 is a deficient number, since it is larger than the sum of its proper divisors (894415971327).
2010010111101 is a wasteful number, since it uses less digits than its factorization.
2010010111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82934172 (or 82934169 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2010010111101 its reverse (1011110100102), we get a palindrome (3021120211203).
The spelling of 2010010111101 in words is "two trillion, ten billion, ten million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •