Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …000000111101111010011 |
3 | 21002101210120102221012111 |
4 | 131020213020013233103 |
5 | 230300310431401321 |
6 | 4131431315210151 |
7 | 264435116260513 |
oct | 35104710075723 |
9 | 7071716387174 |
10 | 2002111200211 |
11 | 7020aa639851 |
12 | 284032ba6957 |
13 | 116a4ba74175 |
14 | 6cc8d013843 |
15 | 3712d5085e1 |
hex | 1d227207bd3 |
2002111200211 has 8 divisors (see below), whose sum is σ = 2005492953600. Its totient is φ = 1998731107080.
The previous prime is 2002111200119. The next prime is 2002111200223. The reversal of 2002111200211 is 1120021112002.
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 2002111200211 - 217 = 2002111069139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002111200191 and 2002111200200.
It is not an unprimeable number, because it can be changed into a prime (2002111200911) 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, 2010730 + ... + 2836768.
It is an arithmetic number, because the mean of its divisors is an integer number (250686619200).
Almost surely, 22002111200211 is an apocalyptic number.
2002111200211 is a deficient number, since it is larger than the sum of its proper divisors (3381753389).
2002111200211 is an equidigital number, since it uses as much as digits as its factorization.
2002111200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830129.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2002111200211 its reverse (1120021112002), we get a palindrome (3122132312213).
It can be divided in two parts, 20021112002 and 11, that multiplied together give a palindrome (220232232022).
The spelling of 2002111200211 in words is "two trillion, two billion, one hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •