Search a number
-
+
105601101005089 is a prime number
BaseRepresentation
bin11000000000101100101100…
…000111010000000100100001
3111211220100220022000120020101
4120000230230013100010201
5102320132023324130324
61012332250455542401
731146266504142664
oct3000545407200441
9454810808016211
10105601101005089
11307141a2558698
12ba1624b08aa01
1346c01aacaa9c1
141c11198b5d6db
15c31dd8842944
hex600b2c1d0121

105601101005089 has 2 divisors, whose sum is σ = 105601101005090. Its totient is φ = 105601101005088.

The previous prime is 105601101005069. The next prime is 105601101005093. The reversal of 105601101005089 is 980500101106501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77443379236864 + 28157721768225 = 8800192^2 + 5306385^2 .

It is a cyclic number.

It is not a de Polignac number, because 105601101005089 - 219 = 105601100480801 is a prime.

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

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

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

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

Almost surely, 2105601101005089 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 37.

The spelling of 105601101005089 in words is "one hundred five trillion, six hundred one billion, one hundred one million, five thousand, eighty-nine".