Base | Representation |
---|---|
bin | 1011101101001100010… |
… | …1110100000011011001 |
3 | 201020002200222010212110 |
4 | 2323103011310003121 |
5 | 11243333130341441 |
6 | 232215541302533 |
7 | 20346456616644 |
oct | 2732305640331 |
9 | 636080863773 |
10 | 201110012121 |
11 | 783213a4797 |
12 | 32b87404a49 |
13 | 15c70297095 |
14 | 9a3b6a8a5b |
15 | 5370b36b16 |
hex | 2ed31740d9 |
201110012121 has 32 divisors (see below), whose sum is σ = 291774044160. Its totient is φ = 122700220416.
The previous prime is 201110012099. The next prime is 201110012137. The reversal of 201110012121 is 121210011102.
201110012121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201110012121 - 225 = 201076457689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201110012097 and 201110012106.
It is not an unprimeable number, because it can be changed into a prime (201110012171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3094600 + ... + 3158918.
It is an arithmetic number, because the mean of its divisors is an integer number (9117938880).
Almost surely, 2201110012121 is an apocalyptic number.
It is an amenable number.
201110012121 is a deficient number, since it is larger than the sum of its proper divisors (90664032039).
201110012121 is a wasteful number, since it uses less digits than its factorization.
201110012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66033.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201110012121 its reverse (121210011102), we get a palindrome (322320023223).
The spelling of 201110012121 in words is "two hundred one billion, one hundred ten million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •