Search a number
-
+
15248729 is a prime number
BaseRepresentation
bin111010001010…
…110101011001
31001200201022202
4322022311121
512400424404
61302455545
7243416636
oct72126531
931621282
1015248729
118675661
1251345b5
13320b922
14204d18d
15151321e
hexe8ad59

15248729 has 2 divisors, whose sum is σ = 15248730. Its totient is φ = 15248728.

The previous prime is 15248713. The next prime is 15248767. The reversal of 15248729 is 92784251.

It is an a-pointer prime, because the next prime (15248767) can be obtained adding 15248729 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13987600 + 1261129 = 3740^2 + 1123^2 .

It is a cyclic number.

It is not a de Polignac number, because 15248729 - 24 = 15248713 is a prime.

It is a super-2 number, since 2×152487292 = 465047472230882, which contains 22 as substring.

It is a Chen prime.

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

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

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

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

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

Almost surely, 215248729 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 40320, while the sum is 38.

The square root of 15248729 is about 3904.9620996880. The cubic root of 15248729 is about 247.9768936589.

The spelling of 15248729 in words is "fifteen million, two hundred forty-eight thousand, seven hundred twenty-nine".