Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111100000110001110011 |
3 | 21010011012010022222000010 |
4 | 131033331333200301303 |
5 | 230413000304342321 |
6 | 4135215235430003 |
7 | 265134642463416 |
oct | 35177577406163 |
9 | 7104163288003 |
10 | 2010011012211 |
11 | 7054938a74a4 |
12 | 285678755303 |
13 | 11770a609037 |
14 | 6d3dc27bb7d |
15 | 37441d13676 |
hex | 1d3fdfe0c73 |
2010011012211 has 8 divisors (see below), whose sum is σ = 2772428982480. Its totient is φ = 1293800191712.
The previous prime is 2010011012209. The next prime is 2010011012213. The reversal of 2010011012211 is 1122101100102.
It is an interprime number because it is at equal distance from previous prime (2010011012209) and next prime (2010011012213).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010011012211 - 21 = 2010011012209 is a prime.
It is a super-2 number, since 2×20100110122112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2010011012213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11551787340 + ... + 11551787513.
It is an arithmetic number, because the mean of its divisors is an integer number (346553622810).
Almost surely, 22010011012211 is an apocalyptic number.
2010011012211 is a deficient number, since it is larger than the sum of its proper divisors (762417970269).
2010011012211 is a wasteful number, since it uses less digits than its factorization.
2010011012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23103574885.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2010011012211 its reverse (1122101100102), we get a palindrome (3132112112313).
The spelling of 2010011012211 in words is "two trillion, ten billion, eleven million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •