Search a number
-
+
15060652639 is a prime number
BaseRepresentation
bin11100000011010111…
…10101001001011111
31102212121021102110121
432001223311021133
5221321011341024
610530242015411
71042134302164
oct160153651137
942777242417
1015060652639
11642938926a
122b03947567
1315602940a6
14a2c2d206b
155d22e58e4
hex381af525f

15060652639 has 2 divisors, whose sum is σ = 15060652640. Its totient is φ = 15060652638.

The previous prime is 15060652603. The next prime is 15060652643. The reversal of 15060652639 is 93625606051.

It is a strong prime.

It is an emirp because it is prime and its reverse (93625606051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15060652639 - 29 = 15060652127 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7530326319 + 7530326320.

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

Almost surely, 215060652639 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 291600, while the sum is 43.

The spelling of 15060652639 in words is "fifteen billion, sixty million, six hundred fifty-two thousand, six hundred thirty-nine".