Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …001110110000101101111001 |
3 | 222101001221001211020122000001 |
4 | 231232202102032300231321 |
5 | 202324441241003323001 |
6 | 1551420354240513001 |
7 | 60234501220611136 |
oct | 5556422216605571 |
9 | 871057054218001 |
10 | 201110002011001 |
11 | 59097300232236 |
12 | 1a68057091b761 |
13 | 882a7902a9a55 |
14 | 3793ac161558d |
15 | 183b4ecb99001 |
hex | b6e8923b0b79 |
201110002011001 has 4 divisors (see below), whose sum is σ = 201158732328192. Its totient is φ = 201061271693812.
The previous prime is 201110002010977. The next prime is 201110002011011. The reversal of 201110002011001 is 100110200011102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201110002011001 - 217 = 201110001879929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201110002011011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24365152405 + ... + 24365160658.
It is an arithmetic number, because the mean of its divisors is an integer number (50289683082048).
Almost surely, 2201110002011001 is an apocalyptic number.
It is an amenable number.
201110002011001 is a deficient number, since it is larger than the sum of its proper divisors (48730317191).
201110002011001 is an equidigital number, since it uses as much as digits as its factorization.
201110002011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48730317190.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201110002011001 its reverse (100110200011102), we get a palindrome (301220202022103).
The spelling of 201110002011001 in words is "two hundred one trillion, one hundred ten billion, two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •