Base | Representation |
---|---|
bin | 101101101110011010000000… |
… | …010010101101000010001101 |
3 | 222101001002010012110120102020 |
4 | 231232122000102231002031 |
5 | 202324320033421320023 |
6 | 1551412324114120353 |
7 | 60234035001361146 |
oct | 5556320022550215 |
9 | 871032105416366 |
10 | 201101111120013 |
11 | 59093558594245 |
12 | 1a67a8ab2800b9 |
13 | 88299a430c400 |
14 | 37934ba8c2acd |
15 | 183b17c370de3 |
hex | b6e6804ad08d |
201101111120013 has 12 divisors (see below), whose sum is σ = 290347166351520. Its totient is φ = 123754529919696.
The previous prime is 201101111120003. The next prime is 201101111120047. The reversal of 201101111120013 is 310021111101102.
It is not a de Polignac number, because 201101111120013 - 212 = 201101111115917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201101111119974 and 201101111120001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101111120003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 198324566673 + ... + 198324567686.
It is an arithmetic number, because the mean of its divisors is an integer number (24195597195960).
Almost surely, 2201101111120013 is an apocalyptic number.
It is an amenable number.
201101111120013 is a deficient number, since it is larger than the sum of its proper divisors (89246055231507).
201101111120013 is a wasteful number, since it uses less digits than its factorization.
201101111120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396649134388 (or 396649134375 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 201101111120013 its reverse (310021111101102), we get a palindrome (511122222221115).
The spelling of 201101111120013 in words is "two hundred one trillion, one hundred one billion, one hundred eleven million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •