Search a number
-
+
10289929061 is a prime number
BaseRepresentation
bin10011001010101001…
…11101101101100101
3222120010022120000202
421211110331231211
5132033210212221
64421020520245
7512664645116
oct114524755545
928503276022
1010289929061
114400440005
121bb20b0085
13c7caa0329
146d887420d
1540357cd0b
hex26553db65

10289929061 has 2 divisors, whose sum is σ = 10289929062. Its totient is φ = 10289929060.

The previous prime is 10289929049. The next prime is 10289929063. The reversal of 10289929061 is 16092998201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10141698436 + 148230625 = 100706^2 + 12175^2 .

It is a cyclic number.

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

Together with 10289929063, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 210289929061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 47.

The spelling of 10289929061 in words is "ten billion, two hundred eighty-nine million, nine hundred twenty-nine thousand, sixty-one".