Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …110001011011101111011001 |
3 | 222101001221002110100101221010 |
4 | 231232202102301123233121 |
5 | 202324441300320200441 |
6 | 1551420355203404133 |
7 | 60234501361065054 |
oct | 5556422261335731 |
9 | 871057073311833 |
10 | 201110011100121 |
11 | 59097305380002 |
12 | 1a680573983649 |
13 | 882a79213cb26 |
14 | 3793ac28dda9b |
15 | 183b4ed892116 |
hex | b6e892c5bbd9 |
201110011100121 has 8 divisors (see below), whose sum is σ = 268146840885280. Its totient is φ = 134073261024192.
The previous prime is 201110011100113. The next prime is 201110011100123. The reversal of 201110011100121 is 121001110011102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201110011100121 - 23 = 201110011100113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201110011100097 and 201110011100106.
It is not an unprimeable number, because it can be changed into a prime (201110011100123) 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, 13768255 + ... + 24326628.
It is an arithmetic number, because the mean of its divisors is an integer number (33518355110660).
Almost surely, 2201110011100121 is an apocalyptic number.
It is an amenable number.
201110011100121 is a deficient number, since it is larger than the sum of its proper divisors (67036829785159).
201110011100121 is a wasteful number, since it uses less digits than its factorization.
201110011100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39854615.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 201110011100121 its reverse (121001110011102), we get a palindrome (322111121111223).
The spelling of 201110011100121 in words is "two hundred one trillion, one hundred ten billion, eleven million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •