Search a number
-
+
201110200413 = 31729135977147
BaseRepresentation
bin1011101101001100011…
…0100010000001011101
3201020002201022201011020
42323103012202001131
511243333202403123
6232215545314353
720346461332623
oct2732306420135
9636081281136
10201110200413
1178321513201
1232b874959b9
1315c703319b5
149a3b717513
155370b727e3
hex2ed31a205d

201110200413 has 16 divisors (see below), whose sum is σ = 293710639680. Its totient is φ = 121835522816.

The previous prime is 201110200393. The next prime is 201110200427. The reversal of 201110200413 is 314002011102.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-201110200413 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 201110200392 and 201110200401.

It is a congruent number.

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

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

Almost surely, 2201110200413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 135977196.

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

Adding to 201110200413 its reverse (314002011102), we get a palindrome (515112211515).

The spelling of 201110200413 in words is "two hundred one billion, one hundred ten million, two hundred thousand, four hundred thirteen".

Divisors: 1 3 17 29 51 87 493 1479 135977147 407931441 2311611499 3943337263 6934834497 11830011789 67036733471 201110200413