110050150101601 has 8 divisors (see below), whose sum is σ = 110088466669064. Its totient is φ = 110011836856320.

The previous prime is 110050150101587. The next prime is 110050150101653. The reversal of 110050150101601 is 106101051050011.

It can be written as a sum of positive squares in 4 ways, for example, as 27108693973201 + 82941456128400 = 5206601^2 + 9107220^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 110050150101601 - 2³⁵ = 110015790363233 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (110050150101901) 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 7 ways as a sum of consecutive naturals, for example, 66377605 + ... + 68015341.

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

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

It is an amenable number.

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

110050150101601 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1661091.

The product of its (nonzero) digits is 150, while the sum is 22.

The spelling of 110050150101601 in words is "one hundred ten trillion, fifty billion, one hundred fifty million, one hundred one thousand, six hundred one".