11031510961 has 3 divisors (see below), whose sum is σ = 11031615993. Its totient is φ = 11031405930.

The previous prime is 11031510947. The next prime is 11031510967. The reversal of 11031510961 is 16901513011.

The square root of 11031510961 is 105031.

It is a perfect power (a square), and thus also a powerful number.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is not a de Polignac number, because 11031510961 - 2³³ = 2441576369 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2^11031510961 is an apocalyptic number.

11031510961 is the 105031-st square number.

11031510961 is the 52516-th centered octagonal number.

It is an amenable number.

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

11031510961 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 210062 (or 105031 counting only the distinct ones).

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

The spelling of 11031510961 in words is "eleven billion, thirty-one million, five hundred ten thousand, nine hundred sixty-one".