Search a number
-
+
15007672129 is a prime number
BaseRepresentation
bin11011111101000011…
…01110011101000001
31102201220120201212111
431332201232131001
5221213431002004
610521110255321
71040622052102
oct157641563501
942656521774
1015007672129
11640149221a
122aaa057541
131552304188
14a252603a9
155cc82ca04
hex37e86e741

15007672129 has 2 divisors, whose sum is σ = 15007672130. Its totient is φ = 15007672128.

The previous prime is 15007672117. The next prime is 15007672151. The reversal of 15007672129 is 92127670051.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12848675904 + 2158996225 = 113352^2 + 46465^2 .

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

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (15007672159) 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, 7503836064 + 7503836065.

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

Almost surely, 215007672129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52920, while the sum is 40.

The spelling of 15007672129 in words is "fifteen billion, seven million, six hundred seventy-two thousand, one hundred twenty-nine".