Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1100000111110110111 |
3 | 201020002002001100112002 |
4 | 2323102203200332313 |
5 | 11243323330133421 |
6 | 232215020445515 |
7 | 20346320322044 |
oct | 2732243407667 |
9 | 636062040462 |
10 | 201101021111 |
11 | 78317313701 |
12 | 32b843a989b |
13 | 15c6b469863 |
14 | 9a3a4081cb |
15 | 536ee5cb0b |
hex | 2ed28e0fb7 |
201101021111 has 48 divisors (see below), whose sum is σ = 226016054880. Its totient is φ = 178371072000.
The previous prime is 201101021083. The next prime is 201101021113. The reversal of 201101021111 is 111120101102.
It is not a de Polignac number, because 201101021111 - 222 = 201096826807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201101021092 and 201101021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101021113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 147759071 + ... + 147760431.
It is an arithmetic number, because the mean of its divisors is an integer number (4708667810).
Almost surely, 2201101021111 is an apocalyptic number.
201101021111 is a deficient number, since it is larger than the sum of its proper divisors (24915033769).
201101021111 is a wasteful number, since it uses less digits than its factorization.
201101021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1728 (or 1705 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201101021111 its reverse (111120101102), we get a palindrome (312221122213).
The spelling of 201101021111 in words is "two hundred one billion, one hundred one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •