Search a number
-
+
10142563214261 is a prime number
BaseRepresentation
bin1001001110010111111111…
…1000001010001110110101
31022220121201200001220112002
42103211333320022032311
52312133432140324021
633323232413305045
72064530112564422
oct223457770121665
938817650056462
1010142563214261
113260489577a55
121179843a95185
13587593a8093a
14270c8cd44d49
15128c70bca50b
hex9397fe0a3b5

10142563214261 has 2 divisors, whose sum is σ = 10142563214262. Its totient is φ = 10142563214260.

The previous prime is 10142563214239. The next prime is 10142563214281. The reversal of 10142563214261 is 16241236524101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8096215798225 + 2046347416036 = 2845385^2 + 1430506^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 210142563214261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69120, while the sum is 38.

Adding to 10142563214261 its reverse (16241236524101), we get a palindrome (26383799738362).

The spelling of 10142563214261 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-three million, two hundred fourteen thousand, two hundred sixty-one".