Search a number
-
+
10500125929 is a prime number
BaseRepresentation
bin10011100011101101…
…10011010011101001
31000002202211122220221
421301312303103221
5133001013012204
64453530050041
7521126412016
oct116166632351
930082748827
1010500125929
1144a9058027
122050579921
13cb44b7987
1471874c70d
15416c4d654
hex271db34e9

10500125929 has 2 divisors, whose sum is σ = 10500125930. Its totient is φ = 10500125928.

The previous prime is 10500125873. The next prime is 10500125947. The reversal of 10500125929 is 92952100501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10318496400 + 181629529 = 101580^2 + 13477^2 .

It is a cyclic number.

It is not a de Polignac number, because 10500125929 - 29 = 10500125417 is a prime.

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

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

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

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

Almost surely, 210500125929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 34.

The spelling of 10500125929 in words is "ten billion, five hundred million, one hundred twenty-five thousand, nine hundred twenty-nine".