Search a number
-
+
15309641 is a prime number
BaseRepresentation
bin111010011001…
…101101001001
31001210210212202
4322121231021
512404402031
61304045545
7244062344
oct72315511
931723782
1015309641
1187073a6
1251638b5
133230579
14206745b
1515262cb
hexe99b49

15309641 has 2 divisors, whose sum is σ = 15309642. Its totient is φ = 15309640.

The previous prime is 15309631. The next prime is 15309683. The reversal of 15309641 is 14690351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12816400 + 2493241 = 3580^2 + 1579^2 .

It is a cyclic number.

It is not a de Polignac number, because 15309641 - 222 = 11115337 is a prime.

It is a Chen prime.

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

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

Almost surely, 215309641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 29.

The square root of 15309641 is about 3912.7536339514. The cubic root of 15309641 is about 248.3066413764.

Adding to 15309641 its reverse (14690351), we get a palindrome (29999992).

The spelling of 15309641 in words is "fifteen million, three hundred nine thousand, six hundred forty-one".