Search a number
-
+
105611110600553 is a prime number
BaseRepresentation
bin11000000000110110000000…
…101110110100111101101001
3111211221022201212211200212022
4120000312000232310331221
5102320313023303204203
61012341024024154225
731150102526251025
oct3000660056647551
9454838655750768
10105611110600553
1130718469726938
12ba18183308975
1346c111497785c
141c1186829d385
15c322c2498a38
hex600d80bb4f69

105611110600553 has 2 divisors, whose sum is σ = 105611110600554. Its totient is φ = 105611110600552.

The previous prime is 105611110600547. The next prime is 105611110600577. The reversal of 105611110600553 is 355006011116501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 92080682673424 + 13530427927129 = 9595868^2 + 3678373^2 .

It is a cyclic number.

It is not a de Polignac number, because 105611110600553 - 24 = 105611110600537 is a prime.

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

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

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

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

Almost surely, 2105611110600553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 35.

The spelling of 105611110600553 in words is "one hundred five trillion, six hundred eleven billion, one hundred ten million, six hundred thousand, five hundred fifty-three".