Search a number
-
+
15372750013 is a prime number
BaseRepresentation
bin11100101000100100…
…11000110010111101
31110200100112121120121
432110102120302331
5222440411000023
611021231214541
71052644135105
oct162422306275
943610477517
1015372750013
116579575685
122b90377451
1315acb392aa
14a5b934205
155ee8e3d5d
hex394498cbd

15372750013 has 2 divisors, whose sum is σ = 15372750014. Its totient is φ = 15372750012.

The previous prime is 15372750007. The next prime is 15372750017. The reversal of 15372750013 is 31005727351.

15372750013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8497521124 + 6875228889 = 92182^2 + 82917^2 .

It is a cyclic number.

It is not a de Polignac number, because 15372750013 - 217 = 15372618941 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (15372750017) by changing a digit.

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 as a sum of consecutive naturals, namely, 7686375006 + 7686375007.

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

Almost surely, 215372750013 is an apocalyptic number.

It is an amenable number.

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

15372750013 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 22050, while the sum is 34.

The spelling of 15372750013 in words is "fifteen billion, three hundred seventy-two million, seven hundred fifty thousand, thirteen".