Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …001110101110100001011011 |
3 | 222101001221001211020011200002 |
4 | 231232202102032232201123 |
5 | 202324441241003031021 |
6 | 1551420354240403215 |
7 | 60234501220543004 |
oct | 5556422216564133 |
9 | 871057054204602 |
10 | 201110002002011 |
11 | 59097300226503 |
12 | 1a68057091650b |
13 | 882a7902a592b |
14 | 3793ac16121ab |
15 | 183b4ecb9650b |
hex | b6e8923ae85b |
201110002002011 has 8 divisors (see below), whose sum is σ = 204521037388800. Its totient is φ = 197699046324840.
The previous prime is 201110002001999. The next prime is 201110002002031. The reversal of 201110002002011 is 110200200011102.
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 201110002002011 - 210 = 201110002000987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201110002001983 and 201110002002001.
It is not an unprimeable number, because it can be changed into a prime (201110002002031) 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, 14827571 + ... + 24941468.
It is an arithmetic number, because the mean of its divisors is an integer number (25565129673600).
Almost surely, 2201110002002011 is an apocalyptic number.
201110002002011 is a deficient number, since it is larger than the sum of its proper divisors (3411035386789).
201110002002011 is an equidigital number, since it uses as much as digits as its factorization.
201110002002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39854809.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201110002002011 its reverse (110200200011102), we get a palindrome (311310202013113).
The spelling of 201110002002011 in words is "two hundred one trillion, one hundred ten billion, two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •