Search a number
-
+
111010010201 = 3170116133167
BaseRepresentation
bin110011101100010110…
…1100101010001011001
3101121112110220210220022
41213120231211101121
53304322030311301
6122555225440225
711006634342416
oct1473055452131
9347473823808
10111010010201
1143096290792
1219621040075
13a61183048c
1455313b910d
152d4ab04d1b
hex19d8b65459

111010010201 has 16 divisors (see below), whose sum is σ = 114861846528. Its totient is φ = 107175432000.

The previous prime is 111010010197. The next prime is 111010010203. The reversal of 111010010201 is 102010010111.

It is a happy number.

It is not a de Polignac number, because 111010010201 - 22 = 111010010197 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35050520 + ... + 35053686.

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

Almost surely, 2111010010201 is an apocalyptic number.

It is an amenable number.

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

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

111010010201 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 5512.

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

Adding to 111010010201 its reverse (102010010111), we get a palindrome (213020020312).

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

Divisors: 1 31 701 1613 3167 21731 50003 98177 1130713 2220067 5108371 35052103 68822077 158359501 3580968071 111010010201