Search a number
-
+
200310113013 = 3193514212509
BaseRepresentation
bin1011101010001101101…
…0011100001011110101
3201011000221211001120120
42322203122130023311
511240213342104023
6232004324522153
720320604603403
oct2724332341365
9634027731516
10200310113013
1177a5092274a
12329a3550359
1315b7364b0ba
1499a3368473
1553257ce8e3
hex2ea369c2f5

200310113013 has 8 divisors (see below), whose sum is σ = 281137000800. Its totient is φ = 126511650288.

The previous prime is 200310113011. The next prime is 200310113039. The reversal of 200310113013 is 310311013002.

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

It is not a de Polignac number, because 200310113013 - 21 = 200310113011 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2200310113013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3514212531.

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

Adding to 200310113013 its reverse (310311013002), we get a palindrome (510621126015).

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

Divisors: 1 3 19 57 3514212509 10542637527 66770037671 200310113013