Search a number
-
+
15000251561 is a prime number
BaseRepresentation
bin11011111100001010…
…11010110010101001
31102201101121201202122
431332011122302221
5221210031022221
610520243241025
71040502014561
oct157605326251
942641551678
1015000251561
1163a8284019
122aa7679175
1315509066c9
14a2428bda1
155cbd63eab
hex37e15aca9

15000251561 has 2 divisors, whose sum is σ = 15000251562. Its totient is φ = 15000251560.

The previous prime is 15000251507. The next prime is 15000251599. The reversal of 15000251561 is 16515200051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9580494400 + 5419757161 = 97880^2 + 73619^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 15000251561.

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

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

Almost surely, 215000251561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1500, while the sum is 26.

The spelling of 15000251561 in words is "fifteen billion, two hundred fifty-one thousand, five hundred sixty-one".