Search a number
-
+
106005651113 is a prime number
BaseRepresentation
bin110001010111001101…
…1011101111010101001
3101010121201100000210102
41202232123131322221
53214044421313423
6120410500555145
710441630111265
oct1425633357251
9333551300712
10106005651113
1140a5847672a
12186650b2ab5
139cc4b0675b
1451b89010a5
152b565dbc28
hex18ae6ddea9

106005651113 has 2 divisors, whose sum is σ = 106005651114. Its totient is φ = 106005651112.

The previous prime is 106005651107. The next prime is 106005651133. The reversal of 106005651113 is 311156500601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77945380969 + 28060270144 = 279187^2 + 167512^2 .

It is a cyclic number.

It is not a de Polignac number, because 106005651113 - 24 = 106005651097 is a prime.

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

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

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

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

Almost surely, 2106005651113 is an apocalyptic number.

It is an amenable number.

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

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

106005651113 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2700, while the sum is 29.

The spelling of 106005651113 in words is "one hundred six billion, five million, six hundred fifty-one thousand, one hundred thirteen".