Search a number
-
+
10613010077 is a prime number
BaseRepresentation
bin10011110001001010…
…11010111010011101
31000101122020202212022
421320211122322131
5133213412310302
64513041345525
7524000045225
oct117045327235
930348222768
1010613010077
11455684960a
1220823382a5
1310019bca27
14729735085
15421aea8a2
hex27895ae9d

10613010077 has 2 divisors, whose sum is σ = 10613010078. Its totient is φ = 10613010076.

The previous prime is 10613010073. The next prime is 10613010103. The reversal of 10613010077 is 77001031601.

It is an a-pointer prime, because the next prime (10613010103) can be obtained adding 10613010077 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9121969081 + 1491040996 = 95509^2 + 38614^2 .

It is a cyclic number.

It is not a de Polignac number, because 10613010077 - 22 = 10613010073 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210613010077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 882, while the sum is 26.

Adding to 10613010077 its reverse (77001031601), we get a palindrome (87614041678).

The spelling of 10613010077 in words is "ten billion, six hundred thirteen million, ten thousand, seventy-seven".