11073711061 has 8 divisors (see below), whose sum is σ = 12656355264. Its totient is φ = 9491238240.

The previous prime is 11073711037. The next prime is 11073711071. The reversal of 11073711061 is 16011737011.

11073711061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 11073711061 - 2⁷ = 11073710933 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159066 + ... + 217828.

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

Almost surely, 2^11073711061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 85691.

The product of its (nonzero) digits is 882, while the sum is 28.

The spelling of 11073711061 in words is "eleven billion, seventy-three million, seven hundred eleven thousand, sixty-one".