Search a number
-
+
201120021103 = 5910709318313
BaseRepresentation
bin1011101101001110101…
…1111111101001101111
3201020010101210122121111
42323103223333221233
511243343211133403
6232220540012451
720346640654441
oct2732353775157
9636111718544
10201120021103
1178327010681
1232b8a831127
1315c7238ca61
149a3cb52491
15537196256d
hex2ed3affa6f

201120021103 has 8 divisors (see below), whose sum is σ = 204548576400. Its totient is φ = 197692123968.

The previous prime is 201120021101. The next prime is 201120021121. The reversal of 201120021103 is 301120021102.

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 201120021103 - 21 = 201120021101 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 (201120021101) 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, 472675 + ... + 790987.

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

Almost surely, 2201120021103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 329081.

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

Adding to 201120021103 its reverse (301120021102), we get a palindrome (502240042205).

Subtracting 201120021103 from its reverse (301120021102), we obtain a palindrome (99999999999).

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

Divisors: 1 59 10709 318313 631831 18780467 3408813917 201120021103