105601101005599 has 4 divisors (see below), whose sum is σ = 105601136696136. Its totient is φ = 105601065315064.

The previous prime is 105601101005527. The next prime is 105601101005683. The reversal of 105601101005599 is 995500101106501.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 105601101005599 - 2¹³ = 105601100997407 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105601101005299) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12961564 + ... + 19473169.

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

Almost surely, 2^{105601101005599} is an apocalyptic number.

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

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

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

The sum of its prime factors is 35690536.

The product of its (nonzero) digits is 60750, while the sum is 43.

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