Search a number
-
+
201020101101 = 32103216850163
BaseRepresentation
bin1011101100110110111…
…0110101000111101101
3201012212102210012010200
42323031232311013231
511243142121213401
6232203010224113
720344315444461
oct2731556650755
9635772705120
10201020101101
1178285674266
1232b61285039
1315c577767b1
149a2d7824a1
155367cc6686
hex2ecdbb51ed

201020101101 has 12 divisors (see below), whose sum is σ = 293181421728. Its totient is φ = 132712299144.

The previous prime is 201020101097. The next prime is 201020101109. The reversal of 201020101101 is 101101020102.

It is a happy number.

It is not a de Polignac number, because 201020101101 - 22 = 201020101097 is a prime.

It is a super-2 number, since 2×2010201011012 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 2201020101101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 201020101101 its reverse (101101020102), we get a palindrome (302121121203).

The spelling of 201020101101 in words is "two hundred one billion, twenty million, one hundred one thousand, one hundred one".

Divisors: 1 3 9 103 309 927 216850163 650550489 1951651467 22335566789 67006700367 201020101101