Search a number
-
+
15059249 is a prime number
BaseRepresentation
bin111001011100…
…100100110001
31001100002101222
4321130210301
512323343444
61254434425
7242000342
oct71344461
931302358
1015059249
118556267
125062a15
1331735ca
1420000c9
1514c6eee
hexe5c931

15059249 has 2 divisors, whose sum is σ = 15059250. Its totient is φ = 15059248.

The previous prime is 15059237. The next prime is 15059251. The reversal of 15059249 is 94295051.

15059249 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., 14386849 + 672400 = 3793^2 + 820^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 15059249 - 28 = 15058993 is a prime.

It is a Sophie Germain prime.

Together with 15059251, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 215059249 is an apocalyptic number.

It is an amenable number.

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

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

15059249 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 16200, while the sum is 35.

The square root of 15059249 is about 3880.6248208246. The cubic root of 15059249 is about 246.9454932806.

It can be divided in two parts, 15059 and 249, that multiplied together give a triangular number (3749691 = T2738).

The spelling of 15059249 in words is "fifteen million, fifty-nine thousand, two hundred forty-nine".