Search a number
-
+
130600600715 = 5132009240011
BaseRepresentation
bin111100110100001100…
…1110000010010001011
3110111002210001220220202
41321220121300102023
54114432223210330
6135555212042415
712302255534564
oct1715031602213
9414083056822
10130600600715
11504296a8362
1221389a6340b
13c414450980
14646d16b16b
1535e594e445
hex1e6867048b

130600600715 has 8 divisors (see below), whose sum is σ = 168776161008. Its totient is φ = 96443520480.

The previous prime is 130600600703. The next prime is 130600600721. The reversal of 130600600715 is 517006006031.

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

It is not a de Polignac number, because 130600600715 - 26 = 130600600651 is a prime.

It is a super-2 number, since 2×1306006007152 (a number of 23 digits) contains 22 as substring.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1004619941 + ... + 1004620070.

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

Almost surely, 2130600600715 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2009240029.

The product of its (nonzero) digits is 3780, while the sum is 29.

Adding to 130600600715 its reverse (517006006031), we get a palindrome (647606606746).

The spelling of 130600600715 in words is "one hundred thirty billion, six hundred million, six hundred thousand, seven hundred fifteen".

Divisors: 1 5 13 65 2009240011 10046200055 26120120143 130600600715