Search a number
-
+
201011111101 = 1736077272633
BaseRepresentation
bin1011101100110100110…
…0100010010010111101
3201012211210212110011201
42323031030202102331
511243132321023401
6232202045415501
720344146152533
oct2731514422275
9635753773151
10201011111101
1178280593a09
1232b5a26a591
1315c55949878
149a2c4c2153
1553670ecb01
hex2ecd3224bd

201011111101 has 16 divisors (see below), whose sum is σ = 202861661184. Its totient is φ = 199169841024.

The previous prime is 201011111099. The next prime is 201011111113. The reversal of 201011111101 is 101111110102.

It is a cyclic number.

It is not a de Polignac number, because 201011111101 - 21 = 201011111099 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201011111141) 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, 76341681 + ... + 76344313.

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

Almost surely, 2201011111101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4140.

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

Adding to 201011111101 its reverse (101111110102), we get a palindrome (302122221203).

Subtracting from 201011111101 its reverse (101111110102), we obtain a palindrome (99900000999).

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

Divisors: 1 173 607 727 2633 105011 125771 441289 455509 1598231 1914191 76342997 276493963 331155043 1161913937 201011111101