Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …101010110111101011001 |
3 | 21010011110002200111201201 |
4 | 131100003331112331121 |
5 | 230413201421023001 |
6 | 4135233213114201 |
7 | 265140266346550 |
oct | 35200375267531 |
9 | 7104402614651 |
10 | 2010111111001 |
11 | 705535356174 |
12 | 2856a6188961 |
13 | 1177252857a6 |
14 | 6d40b696d97 |
15 | 3744a9d7501 |
hex | 1d403f56f59 |
2010111111001 has 8 divisors (see below), whose sum is σ = 2297343470400. Its totient is φ = 1722897158928.
The previous prime is 2010111110879. The next prime is 2010111111053. The reversal of 2010111111001 is 1001111110102.
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 2010111111001 - 225 = 2010077556569 is a prime.
It is a super-3 number, since 3×20101111110013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010111151001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4367026 + ... + 4805323.
It is an arithmetic number, because the mean of its divisors is an integer number (287167933800).
Almost surely, 22010111111001 is an apocalyptic number.
It is an amenable number.
2010111111001 is a deficient number, since it is larger than the sum of its proper divisors (287232359399).
2010111111001 is an equidigital number, since it uses as much as digits as its factorization.
2010111111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9203663.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 2010111111001 its reverse (1001111110102), we get a palindrome (3011222221103).
The spelling of 2010111111001 in words is "two trillion, ten billion, one hundred eleven million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •