Search a number
-
+
10015391 is a prime number
BaseRepresentation
bin100110001101…
…001010011111
3200211211112102
4212031022133
510030443031
6554355315
7151062251
oct46151237
920754472
1010015391
115720791
12342bb3b
1320c8889
141489cd1
15d2c7cb
hex98d29f

10015391 has 2 divisors, whose sum is σ = 10015392. Its totient is φ = 10015390.

The previous prime is 10015351. The next prime is 10015393. The reversal of 10015391 is 19351001.

It is a strong prime.

It is an emirp because it is prime and its reverse (19351001) is a distict prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

Together with 10015393, 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 (10015393) 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, 5007695 + 5007696.

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

Almost surely, 210015391 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 135, while the sum is 20.

The square root of 10015391 is about 3164.7102552998. The cubic root of 10015391 is about 215.5539420273.

Adding to 10015391 its reverse (19351001), we get a palindrome (29366392).

The spelling of 10015391 in words is "ten million, fifteen thousand, three hundred ninety-one".