Search a number
-
+
10342215131 is a prime number
BaseRepresentation
bin10011010000111000…
…11010110111011011
3222200202200222000212
421220130122313123
5132140101341011
64430125321335
7514201243463
oct115034326733
928622628025
1010342215131
114427a02336
12200770624b
13c8a879131
147017a4ba3
15407e5a08b
hex26871addb

10342215131 has 2 divisors, whose sum is σ = 10342215132. Its totient is φ = 10342215130.

The previous prime is 10342215127. The next prime is 10342215137. The reversal of 10342215131 is 13151224301.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10342215131 - 22 = 10342215127 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 210342215131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 720, while the sum is 23.

Adding to 10342215131 its reverse (13151224301), we get a palindrome (23493439432).

The spelling of 10342215131 in words is "ten billion, three hundred forty-two million, two hundred fifteen thousand, one hundred thirty-one".