Base | Representation |
---|---|
bin | 1011101101001111000… |
… | …0000111100100011111 |
3 | 201020010110211120110211 |
4 | 2323103300013210133 |
5 | 11243344000231421 |
6 | 232221015113251 |
7 | 20346653106166 |
oct | 2732360074437 |
9 | 636113746424 |
10 | 201121102111 |
11 | 78327689876 |
12 | 32b8b072827 |
13 | 15c7267aac7 |
14 | 9a3cd543dd |
15 | 5371ac79e1 |
hex | 2ed3c0791f |
201121102111 has 8 divisors (see below), whose sum is σ = 201321839664. Its totient is φ = 200920420800.
The previous prime is 201121102103. The next prime is 201121102129. The reversal of 201121102111 is 111201121102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201121102111 - 23 = 201121102103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201121102091 and 201121102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121103111) 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, 11803380 + ... + 11820406.
It is an arithmetic number, because the mean of its divisors is an integer number (25165229958).
Almost surely, 2201121102111 is an apocalyptic number.
201121102111 is a deficient number, since it is larger than the sum of its proper divisors (200737553).
201121102111 is a wasteful number, since it uses less digits than its factorization.
201121102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28121.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201121102111 its reverse (111201121102), we get a palindrome (312322223213).
It can be divided in two parts, 201121102 and 111, that multiplied together give a palindrome (22324442322).
The spelling of 201121102111 in words is "two hundred one billion, one hundred twenty-one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •