Search a number
-
+
105611010517 is a prime number
BaseRepresentation
bin110001001011011101…
…0000010000111010101
3101002121012202012200001
41202112322002013111
53212242404314032
6120303402251301
710426065530515
oct1422672020725
9332535665601
10105611010517
1140875731381
1218574ab6b31
139c611206cc
14517c333845
152b31b363e7
hex1896e821d5

105611010517 has 2 divisors, whose sum is σ = 105611010518. Its totient is φ = 105611010516.

The previous prime is 105611010467. The next prime is 105611010523. The reversal of 105611010517 is 715010116501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105500886481 + 110124036 = 324809^2 + 10494^2 .

It is a cyclic number.

It is not a de Polignac number, because 105611010517 - 215 = 105610977749 is a prime.

It is a super-2 number, since 2×1056110105172 (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 (105611014517) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2105611010517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 28.

The spelling of 105611010517 in words is "one hundred five billion, six hundred eleven million, ten thousand, five hundred seventeen".