Search a number
-
+
201020110110 = 23252233556779
BaseRepresentation
bin1011101100110110111…
…0110111010100011110
3201012212102210122111100
42323031232313110132
511243142122010420
6232203010333530
720344315512651
oct2731556672436
9635772718440
10201020110110
1178285680006
1232b6128a2a6
1315c5777a921
149a2d785898
155367cc9190
hex2ecdbb751e

201020110110 has 24 divisors (see below), whose sum is σ = 522652286520. Its totient is φ = 53605362672.

The previous prime is 201020110099. The next prime is 201020110189. The reversal of 201020110110 is 11011020102.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2201020110110 is an apocalyptic number.

201020110110 is an abundant number, since it is smaller than the sum of its proper divisors (321632176410).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 201020110110 its reverse (11011020102), we get a palindrome (212031130212).

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

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 2233556779 4467113558 6700670337 11167783895 13401340674 20102011011 22335567790 33503351685 40204022022 67006703370 100510055055 201020110110