Base | Representation |
---|---|
bin | 11101010000111000111… |
… | …101000000001100100011 |
3 | 21010020202001200102120002 |
4 | 131100320331000030203 |
5 | 230422012023211321 |
6 | 4135501333410215 |
7 | 265201313514536 |
oct | 35207075001443 |
9 | 7106661612502 |
10 | 2011000210211 |
11 | 705951212603 |
12 | 2858b3a9996b |
13 | 1178375335b5 |
14 | 6d4937b6a1d |
15 | 3749daae20b |
hex | 1d438f40323 |
2011000210211 has 8 divisors (see below), whose sum is σ = 2016122950800. Its totient is φ = 2005880332288.
The previous prime is 2011000210199. The next prime is 2011000210223. The reversal of 2011000210211 is 1120120001102.
It is an interprime number because it is at equal distance from previous prime (2011000210199) and next prime (2011000210223).
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 2011000210211 - 222 = 2010996015907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011000210192 and 2011000210201.
It is not an unprimeable number, because it can be changed into a prime (2011000210231) 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, 694640 + ... + 2122386.
It is an arithmetic number, because the mean of its divisors is an integer number (252015368850).
Almost surely, 22011000210211 is an apocalyptic number.
2011000210211 is a deficient number, since it is larger than the sum of its proper divisors (5122740589).
2011000210211 is a wasteful number, since it uses less digits than its factorization.
2011000210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1431333.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011000210211 its reverse (1120120001102), we get a palindrome (3131120211313).
The spelling of 2011000210211 in words is "two trillion, eleven billion, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •