Search a number
-
+
105611104223 is a prime number
BaseRepresentation
bin110001001011011101…
…0011000111111011111
3101002121012220222012122
41202112322120333133
53212242420313343
6120303404253155
710426066400642
oct1422672307737
9332535828178
10105611104223
1140875795819
1218574b411bb
139c61154261
14517c359a59
152b31b54068
hex1896e98fdf

105611104223 has 2 divisors, whose sum is σ = 105611104224. Its totient is φ = 105611104222.

The previous prime is 105611104199. The next prime is 105611104241. The reversal of 105611104223 is 322401116501.

It is a strong prime.

It is an emirp because it is prime and its reverse (322401116501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 105611104223 - 214 = 105611087839 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 105611104192 and 105611104201.

It is a congruent number.

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

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

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

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

Almost surely, 2105611104223 is an apocalyptic number.

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

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

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

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

The spelling of 105611104223 in words is "one hundred five billion, six hundred eleven million, one hundred four thousand, two hundred twenty-three".