Search a number
-
+
105002520001129 is a prime number
BaseRepresentation
bin10111110111111111001101…
…111001111011101001101001
3111202210010212011020222101001
4113313333031321323221221
5102230330130110014004
61011153254115355001
731055116221435442
oct2767771571735151
9452703764228331
10105002520001129
11305033561488a3
12b93a2375b2a61
13467890632042a
141bd02131342c9
15c2155336d1a4
hex5f7fcde7ba69

105002520001129 has 2 divisors, whose sum is σ = 105002520001130. Its totient is φ = 105002520001128.

The previous prime is 105002520001073. The next prime is 105002520001163. The reversal of 105002520001129 is 921100025200501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52941965911129 + 52060554090000 = 7276123^2 + 7215300^2 .

It is a cyclic number.

It is not a de Polignac number, because 105002520001129 - 221 = 105002517903977 is a prime.

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

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

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

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

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

Almost surely, 2105002520001129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1800, while the sum is 28.

The spelling of 105002520001129 in words is "one hundred five trillion, two billion, five hundred twenty million, one thousand, one hundred twenty-nine".