11050151561 has 4 divisors (see below), whose sum is σ = 11431191300. Its totient is φ = 10669111824.

The previous prime is 11050151549. The next prime is 11050151569. The reversal of 11050151561 is 16515105011.

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

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16515105011 = 47 ⋅351385213.

It can be written as a sum of positive squares in 2 ways, for example, as 8575686025 + 2474465536 = 92605^2 + 49744^2 .

It is a cyclic number.

It is not a de Polignac number, because 11050151561 - 2¹⁰ = 11050150537 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 11050151561.

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

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

Almost surely, 2^11050151561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 381039738.

The product of its (nonzero) digits is 750, while the sum is 26.

Adding to 11050151561 its reverse (16515105011), we get a palindrome (27565256572).

The spelling of 11050151561 in words is "eleven billion, fifty million, one hundred fifty-one thousand, five hundred sixty-one".