10321957391 has 2 divisors, whose sum is σ = 10321957392. Its totient is φ = 10321957390.

The previous prime is 10321957379. The next prime is 10321957397. The reversal of 10321957391 is 19375912301.

10321957391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 2^10321957391 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 51030, while the sum is 41.

The spelling of 10321957391 in words is "ten billion, three hundred twenty-one million, nine hundred fifty-seven thousand, three hundred ninety-one".