Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …0011001001000111001 |
3 | 201012211010001110011010 |
4 | 2323030212121020321 |
5 | 11243122241041441 |
6 | 232201051224133 |
7 | 20343665156145 |
oct | 2731446311071 |
9 | 635733043133 |
10 | 201001112121 |
11 | 78275984597 |
12 | 32b56a48049 |
13 | 15c53858604 |
14 | 9a2b03c225 |
15 | 53662c5116 |
hex | 2ecc999239 |
201001112121 has 16 divisors (see below), whose sum is σ = 270681078528. Its totient is φ = 132661200000.
The previous prime is 201001112113. The next prime is 201001112171. The reversal of 201001112121 is 121211100102.
201001112121 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 201001112121 - 23 = 201001112113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201001112097 and 201001112106.
It is not an unprimeable number, because it can be changed into a prime (201001112171) 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 15 ways as a sum of consecutive naturals, for example, 3915621 + ... + 3966621.
It is an arithmetic number, because the mean of its divisors is an integer number (16917567408).
Almost surely, 2201001112121 is an apocalyptic number.
It is an amenable number.
201001112121 is a deficient number, since it is larger than the sum of its proper divisors (69679966407).
201001112121 is a wasteful number, since it uses less digits than its factorization.
201001112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64112.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201001112121 its reverse (121211100102), we get a palindrome (322212212223).
The spelling of 201001112121 in words is "two hundred one billion, one million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •