Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …100000010010101110111 |
3 | 21010011012001121200012200 |
4 | 131033331330002111313 |
5 | 230413000041213421 |
6 | 4135215204115543 |
7 | 265134631650225 |
oct | 35177574022567 |
9 | 7104161550180 |
10 | 2010010101111 |
11 | 705493334a21 |
12 | 285678395bb3 |
13 | 11770a37a41c |
14 | 6d3dc0c1b15 |
15 | 37441bd3726 |
hex | 1d3fdf02577 |
2010010101111 has 24 divisors (see below), whose sum is σ = 2913688761984. Its totient is φ = 1335236691600.
The previous prime is 2010010101109. The next prime is 2010010101139. The reversal of 2010010101111 is 1111010100102.
It is not a de Polignac number, because 2010010101111 - 21 = 2010010101109 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 = 2010010101093 and 2010010101102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010010101161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9139086 + ... + 9356436.
It is an arithmetic number, because the mean of its divisors is an integer number (121403698416).
Almost surely, 22010010101111 is an apocalyptic number.
2010010101111 is a deficient number, since it is larger than the sum of its proper divisors (903678660873).
2010010101111 is a wasteful number, since it uses less digits than its factorization.
2010010101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221011 (or 221008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2010010101111 its reverse (1111010100102), we get a palindrome (3121020201213).
The spelling of 2010010101111 in words is "two trillion, ten billion, ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •