Search a number
-
+
201101110101 = 3318673989389
BaseRepresentation
bin1011101101001010001…
…1110110101101010101
3201020002002012212121000
42323102203312231111
511243323341010401
6232215022413513
720346321142353
oct2732243665525
9636062185530
10201101110101
1178317374551
1232b84431299
1315c6b49b208
149a3a42c7d3
15536ee79186
hex2ed28f6b55

201101110101 has 16 divisors (see below), whose sum is σ = 298087220800. Its totient is φ = 133995564144.

The previous prime is 201101110079. The next prime is 201101110109. The reversal of 201101110101 is 101011101102.

It is not a de Polignac number, because 201101110101 - 27 = 201101109973 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2201101110101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 201101110101 its reverse (101011101102), we get a palindrome (302112211203).

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

Divisors: 1 3 9 27 1867 5601 16803 50409 3989389 11968167 35904501 107713503 7448189263 22344567789 67033703367 201101110101