Search a number
-
+
106005011701 is a prime number
BaseRepresentation
bin110001010111001100…
…1000001110011110101
3101010121200010112200111
41202232121001303311
53214044240333301
6120410435143021
710441621506151
oct1425631016365
9333550115614
10106005011701
1140a5807a296
1218664a44a71
139cc49416c4
1451b87b6061
152b56512551
hex18ae641cf5

106005011701 has 2 divisors, whose sum is σ = 106005011702. Its totient is φ = 106005011700.

The previous prime is 106005011681. The next prime is 106005011711. The reversal of 106005011701 is 107110500601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100442089476 + 5562922225 = 316926^2 + 74585^2 .

It is a cyclic number.

It is not a de Polignac number, because 106005011701 - 27 = 106005011573 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106005011701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 210, while the sum is 22.

The spelling of 106005011701 in words is "one hundred six billion, five million, eleven thousand, seven hundred one".