Search a number
-
+
10321430131 is a prime number
BaseRepresentation
bin10011001110011010…
…01000011001110011
3222122022120222101001
421213031020121303
5132114241231011
64424104022431
7513526465015
oct114715103163
928568528331
1010321430131
1144171a6251
122000761a17
13c8647c60c
146dcb141b5
154062017c1
hex267348673

10321430131 has 2 divisors, whose sum is σ = 10321430132. Its totient is φ = 10321430130.

The previous prime is 10321430083. The next prime is 10321430143. The reversal of 10321430131 is 13103412301.

10321430131 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 not a de Polignac number, because 10321430131 - 29 = 10321429619 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10321430099 and 10321430108.

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

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

Almost surely, 210321430131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 19.

Adding to 10321430131 its reverse (13103412301), we get a palindrome (23424842432).

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