Base | Representation |
---|---|
bin | 1011101101001100100… |
… | …1101010001010101101 |
3 | 201020002202212100200220 |
4 | 2323103021222022231 |
5 | 11243333410121310 |
6 | 232220015041553 |
7 | 20346501315654 |
oct | 2732311521255 |
9 | 636082770626 |
10 | 201111020205 |
11 | 78321a23117 |
12 | 32b878102b9 |
13 | 15c7055ab94 |
14 | 9a3b88c19b |
15 | 5370c85670 |
hex | 2ed326a2ad |
201111020205 has 8 divisors (see below), whose sum is σ = 321777632352. Its totient is φ = 107259210768.
The previous prime is 201111020197. The next prime is 201111020207. The reversal of 201111020205 is 502020111102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201111020205 - 23 = 201111020197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 13407401347 = 201111020205 / (2 + 0 + 1 + 1 + 1 + 1 + 0 + 2 + 0 + 2 + 0 + 5).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201111020207) 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, 6703700659 + ... + 6703700688.
It is an arithmetic number, because the mean of its divisors is an integer number (40222204044).
Almost surely, 2201111020205 is an apocalyptic number.
It is an amenable number.
201111020205 is a deficient number, since it is larger than the sum of its proper divisors (120666612147).
201111020205 is a wasteful number, since it uses less digits than its factorization.
201111020205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13407401355.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 201111020205 its reverse (502020111102), we get a palindrome (703131131307).
The spelling of 201111020205 in words is "two hundred one billion, one hundred eleven million, twenty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •