Search a number
-
+
201111111103 = 7171690009337
BaseRepresentation
bin1011101101001100101…
…0000000010110111111
3201020002210000222101111
42323103022000112333
511243333421023403
6232220021022451
720346502144660
oct2732312002677
9636083028344
10201111111103
1178321a85441
1232b87854a27
1315c70590376
149a3b8b3367
155370ca256d
hex2ed32805bf

201111111103 has 8 divisors (see below), whose sum is σ = 243361344672. Its totient is φ = 162240896256.

The previous prime is 201111111101. The next prime is 201111111109. The reversal of 201111111103 is 301111111102.

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

It is a cyclic number.

It is not a de Polignac number, because 201111111103 - 21 = 201111111101 is a prime.

It is a congruent number.

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

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

Almost surely, 2201111111103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1690009361.

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 201111111103 its reverse (301111111102), we get a palindrome (502222222205).

Subtracting 201111111103 from its reverse (301111111102), we obtain a palindrome (99999999999).

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

Divisors: 1 7 17 119 1690009337 11830065359 28730158729 201111111103