Search a number
-
+
201111010101 = 3274330074923
BaseRepresentation
bin1011101101001100100…
…1100111101100110101
3201020002202211211211200
42323103021213230311
511243333404310401
6232220014523113
720346501244341
oct2732311475465
9636082754750
10201111010101
1178321a16571
1232b87806499
1315c705563c1
149a3b888621
155370c82686
hex2ed3267b35

201111010101 has 12 divisors (see below), whose sum is σ = 290884664928. Its totient is φ = 133893552744.

The previous prime is 201111010091. The next prime is 201111010117. The reversal of 201111010101 is 101010111102.

It is not a de Polignac number, because 201111010101 - 217 = 201110879029 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15030775 + ... + 15044148.

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

Almost surely, 2201111010101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30075672 (or 30075669 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 201111010101 its reverse (101010111102), we get a palindrome (302121121203).

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

Divisors: 1 3 9 743 2229 6687 30074923 90224769 270674307 22345667789 67037003367 201111010101