Search a number
-
+
15147001 is a prime number
BaseRepresentation
bin111001110001…
…111111111001
31001111112210001
4321301333321
512334201001
61300353001
7242514232
oct71617771
931445701
1015147001
118606191
1250a5761
1331a452c
142024089
1514e3001
hexe71ff9

15147001 has 2 divisors, whose sum is σ = 15147002. Its totient is φ = 15147000.

The previous prime is 15146981. The next prime is 15147007. The reversal of 15147001 is 10074151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12257001 + 2890000 = 3501^2 + 1700^2 .

It is a cyclic number.

It is not a de Polignac number, because 15147001 - 211 = 15144953 is a prime.

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

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

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

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

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

Almost surely, 215147001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 140, while the sum is 19.

The square root of 15147001 is about 3891.9148243506. The cubic root of 15147001 is about 247.4242246686.

It can be divided in two parts, 1514 and 7001, that added together give a triangular number (8515 = T130).

The spelling of 15147001 in words is "fifteen million, one hundred forty-seven thousand, one".