Search a number
-
+
201101012111 = 29109716133919
BaseRepresentation
bin1011101101001010001…
…1011110110010001111
3201020002002000220011202
42323102203132302033
511243323324341421
6232215020340115
720346320253566
oct2732243366217
9636062026152
10201101012111
117831730796a
1232b843a463b
1315c6b46572c
149a3a404bdd
15536ee5a10b
hex2ed28dec8f

201101012111 has 16 divisors (see below), whose sum is σ = 208407427200. Its totient is φ = 193819761408.

The previous prime is 201101012041. The next prime is 201101012153. The reversal of 201101012111 is 111210101102.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-201101012111 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 201101012092 and 201101012101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201101012171) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51312410 + ... + 51316328.

It is an arithmetic number, because the mean of its divisors is an integer number (13025464200).

Almost surely, 2201101012111 is an apocalyptic number.

201101012111 is a deficient number, since it is larger than the sum of its proper divisors (7306415089).

201101012111 is a wasteful number, since it uses less digits than its factorization.

201101012111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 6658.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 201101012111 its reverse (111210101102), we get a palindrome (312311113213).

The spelling of 201101012111 in words is "two hundred one billion, one hundred one million, twelve thousand, one hundred eleven".

Divisors: 1 29 1097 1613 3919 31813 46777 113651 1769461 4299143 6321347 51314369 124675147 183319063 6934517659 201101012111