Search a number
-
+
10320113231 is a prime number
BaseRepresentation
bin10011001110010000…
…00110111001001111
3222122020010001220222
421213020012321033
5132113422110411
64424015501555
7513512341451
oct114710067117
928566101828
1010320113231
1144164868aa
1220002278bb
13c8610b09c
146dc8902d1
154060414db
hex267206e4f

10320113231 has 2 divisors, whose sum is σ = 10320113232. Its totient is φ = 10320113230.

The previous prime is 10320113213. The next prime is 10320113257. The reversal of 10320113231 is 13231102301.

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

Together with previous prime (10320113213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10320113231 - 210 = 10320112207 is a prime.

It is a super-2 number, since 2×103201132312 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 210320113231 is an apocalyptic number.

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

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

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

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

Adding to 10320113231 its reverse (13231102301), we get a palindrome (23551215532).

The spelling of 10320113231 in words is "ten billion, three hundred twenty million, one hundred thirteen thousand, two hundred thirty-one".