Search a number
-
+
105611014517 is a prime number
BaseRepresentation
bin110001001011011101…
…0000011000101110101
3101002121012202102011012
41202112322003011311
53212242404431032
6120303402322005
710426065545261
oct1422672030565
9332535672135
10105611014517
1140875734388
1218574ab9305
139c61122488
14517c3350a1
152b31b376b2
hex1896e83175

105611014517 has 2 divisors, whose sum is σ = 105611014518. Its totient is φ = 105611014516.

The previous prime is 105611014513. The next prime is 105611014549. The reversal of 105611014517 is 715410116501.

It is an a-pointer prime, because the next prime (105611014549) can be obtained adding 105611014517 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 101706139396 + 3904875121 = 318914^2 + 62489^2 .

It is a cyclic number.

It is not a de Polignac number, because 105611014517 - 22 = 105611014513 is a prime.

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

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

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

Almost surely, 2105611014517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 32.

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