Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …000110000100011110111 |
3 | 21002012101010200222100100 |
4 | 131012221320300203313 |
5 | 230232010031133421 |
6 | 4130443015445143 |
7 | 264332053453104 |
oct | 35065170604367 |
9 | 7065333628310 |
10 | 2000010021111 |
11 | 7012215758a3 |
12 | 2837473867b3 |
13 | 1167a566271b |
14 | 6cb2dd3baab |
15 | 37058d0bc26 |
hex | 1d1a9e308f7 |
2000010021111 has 12 divisors (see below), whose sum is σ = 2889345921280. Its totient is φ = 1333135756800.
The previous prime is 2000010021089. The next prime is 2000010021133. The reversal of 2000010021111 is 1111200100002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2000010021089) and next prime (2000010021133).
It is not a de Polignac number, because 2000010021111 - 29 = 2000010020599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000010021093 and 2000010021102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000010021011) 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, 16959415 + ... + 17076936.
Almost surely, 22000010021111 is an apocalyptic number.
2000010021111 is a deficient number, since it is larger than the sum of its proper divisors (889335900169).
2000010021111 is a wasteful number, since it uses less digits than its factorization.
2000010021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34042886 (or 34042883 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2000010021111 its reverse (1111200100002), we get a palindrome (3111210121113).
The spelling of 2000010021111 in words is "two trillion, ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •