Base | Representation |
---|---|
bin | 11101000111110000110… |
… | …111111111011001111111 |
3 | 21002022110010202002010202 |
4 | 131013300313333121333 |
5 | 230241424424031421 |
6 | 4131201122354115 |
7 | 264403424565653 |
oct | 35076067773177 |
9 | 7068403662122 |
10 | 2001201002111 |
11 | 701782881513 |
12 | 283a1a1bb93b |
13 | 1169353199cc |
14 | 6cc041a0a63 |
15 | 370c866510b |
hex | 1d1f0dff67f |
2001201002111 has 4 divisors (see below), whose sum is σ = 2001884708832. Its totient is φ = 2000517295392.
The previous prime is 2001201002081. The next prime is 2001201002137. The reversal of 2001201002111 is 1112001021002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2001201002111 - 234 = 1984021132927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001201002092 and 2001201002101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001201902111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 341848970 + ... + 341854823.
It is an arithmetic number, because the mean of its divisors is an integer number (500471177208).
Almost surely, 22001201002111 is an apocalyptic number.
2001201002111 is a deficient number, since it is larger than the sum of its proper divisors (683706721).
2001201002111 is an equidigital number, since it uses as much as digits as its factorization.
2001201002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683706720.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001201002111 its reverse (1112001021002), we get a palindrome (3113202023113).
The spelling of 2001201002111 in words is "two trillion, one billion, two hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •