Search a number
-
+
201110200212013 = 9192179327130703
BaseRepresentation
bin101101101110100010011110…
…000010110101101000101101
3222101001221120122012021200021
4231232202132002311220231
5202324442142223241023
61551420430041002141
760234506145363511
oct5556423602655055
9871057518167607
10201110200212013
11590973a20a6624
121a680607183351
13882a7c2384261
143793adda8a141
15183b51029a35d
hexb6e89e0b5a2d

201110200212013 has 16 divisors (see below), whose sum is σ = 201489571532800. Its totient is φ = 200731244258160.

The previous prime is 201110200211953. The next prime is 201110200212029. The reversal of 201110200212013 is 310212002011102.

It is a cyclic number.

It is not a de Polignac number, because 201110200212013 - 229 = 201109663341101 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 (201110200212613) by changing a digit.

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

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

Almost surely, 2201110200212013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 37072.

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 201110200212013 its reverse (310212002011102), we get a palindrome (511322202223115).

The spelling of 201110200212013 in words is "two hundred one trillion, one hundred ten billion, two hundred million, two hundred twelve thousand, thirteen".

Divisors: 1 919 2179 3271 30703 2002501 3006049 7127509 28216057 66901837 100429513 6550180771 61482788203 92294722447 218835908827 201110200212013