Search a number
-
+
10431325097 is a prime number
BaseRepresentation
bin10011011011100000…
…10110001110101001
3222220222101012220222
421231300112032221
5132330404400342
64443031255425
7516332541344
oct115560261651
928828335828
1010431325097
114473235a36
12203151a575
13ca3178c1b
1470d55d45b
15410baced2
hex26dc163a9

10431325097 has 2 divisors, whose sum is σ = 10431325098. Its totient is φ = 10431325096.

The previous prime is 10431325063. The next prime is 10431325231. The reversal of 10431325097 is 79052313401.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7351519081 + 3079806016 = 85741^2 + 55496^2 .

It is a cyclic number.

It is not a de Polignac number, because 10431325097 - 218 = 10431062953 is a prime.

It is a super-3 number, since 3×104313250973 (a number of 31 digits) contains 333 as substring.

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

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

Almost surely, 210431325097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 35.

Adding to 10431325097 its reverse (79052313401), we get a palindrome (89483638498).

The spelling of 10431325097 in words is "ten billion, four hundred thirty-one million, three hundred twenty-five thousand, ninety-seven".