Search a number
-
+
10350131516371 is a prime number
BaseRepresentation
bin1001011010011101001111…
…1010011001001111010011
31100122110111110110011202001
42112213103322121033103
52324034032132010441
634002441302334431
72115525623210233
oct226472372311723
940573443404661
1010350131516371
113330514460589
1211b1b1212a417
135a102305388a
1427ad40237cc3
1512e36d7c4731
hex969d3e993d3

10350131516371 has 2 divisors, whose sum is σ = 10350131516372. Its totient is φ = 10350131516370.

The previous prime is 10350131516317. The next prime is 10350131516393. The reversal of 10350131516371 is 17361513105301.

It is a happy number.

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

It is a strong prime.

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10350131516371.

It is not a weakly prime, because it can be changed into another prime (10350131516311) by changing a digit.

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

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

Almost surely, 210350131516371 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 28350, while the sum is 37.

The spelling of 10350131516371 in words is "ten trillion, three hundred fifty billion, one hundred thirty-one million, five hundred sixteen thousand, three hundred seventy-one".