10011010391 has 2 divisors, whose sum is σ = 10011010392. Its totient is φ = 10011010390.

The previous prime is 10011010381. The next prime is 10011010393. The reversal of 10011010391 is 19301011001.

It is a strong prime.

It is a cyclic number.

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

Together with 10011010393, 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 (10011010393) by changing a digit.

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

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

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

Almost surely, 2^10011010391 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 17.

Adding to 10011010391 its reverse (19301011001), we get a palindrome (29312021392).

The spelling of 10011010391 in words is "ten billion, eleven million, ten thousand, three hundred ninety-one".