Search a number
-
+
201200101111 = 7125261112181
BaseRepresentation
bin1011101101100001110…
…1011110011011110111
3201020022222111010201201
42323120131132123313
511244024211213421
6232232520233331
720351632433032
oct2733035363367
9636288433651
10201200101111
11783682369a9
1232bb160b847
1315c85b4a689
149a4963a019
1553789ceb91
hex2ed875e6f7

201200101111 has 8 divisors (see below), whose sum is σ = 204043801248. Its totient is φ = 198356676000.

The previous prime is 201200101021. The next prime is 201200101153. The reversal of 201200101111 is 111101002102.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 201200101111 - 215 = 201200068343 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 (201200401111) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1737441 + ... + 1849621.

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

Almost surely, 2201200101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 137513.

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

Adding to 201200101111 its reverse (111101002102), we get a palindrome (312301103213).

Subtracting from 201200101111 its reverse (111101002102), we obtain a palindrome (90099099009).

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

Divisors: 1 71 25261 112181 1793531 7964851 2833804241 201200101111