Search a number
-
+
15309901 is a prime number
BaseRepresentation
bin111010011001…
…110001001101
31001210211020101
4322121301031
512404404101
61304051101
7244063165
oct72316115
931724211
1015309901
118707612
125163a91
133230719
1420675a5
151526401
hexe99c4d

15309901 has 2 divisors, whose sum is σ = 15309902. Its totient is φ = 15309900.

The previous prime is 15309857. The next prime is 15309907. The reversal of 15309901 is 10990351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9302500 + 6007401 = 3050^2 + 2451^2 .

It is a cyclic number.

It is not a de Polignac number, because 15309901 - 29 = 15309389 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215309901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1215, while the sum is 28.

The square root of 15309901 is about 3912.7868584936. The cubic root of 15309901 is about 248.3080470127.

The spelling of 15309901 in words is "fifteen million, three hundred nine thousand, nine hundred one".