Search a number
-
+
15390671 is a prime number
BaseRepresentation
bin111010101101…
…011111001111
31001221221000212
4322231133033
512420000141
61305513035
7244550522
oct72553717
931857025
1015390671
11876226a
1251a277b
13325b40a
142088bb9
1515402eb
hexead7cf

15390671 has 2 divisors, whose sum is σ = 15390672. Its totient is φ = 15390670.

The previous prime is 15390653. The next prime is 15390673. The reversal of 15390671 is 17609351.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15390671 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 215390671 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 32.

The square root of 15390671 is about 3923.0945693419. The cubic root of 15390671 is about 248.7439452075.

It can be divided in two parts, 15390 and 671, that added together give a palindrome (16061).

The spelling of 15390671 in words is "fifteen million, three hundred ninety thousand, six hundred seventy-one".