11015251056361 has 2 divisors, whose sum is σ = 11015251056362. Its totient is φ = 11015251056360.

The previous prime is 11015251056319. The next prime is 11015251056413. The reversal of 11015251056361 is 16365015251011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9816039899136 + 1199211157225 = 3133056^2 + 1095085^2 .

It is a cyclic number.

It is not a de Polignac number, because 11015251056361 - 2⁷ = 11015251056233 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (11015251056301) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507625528180 + 5507625528181.

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

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

It is an amenable number.

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

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

11015251056361 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 27000, while the sum is 37.

The spelling of 11015251056361 in words is "eleven trillion, fifteen billion, two hundred fifty-one million, fifty-six thousand, three hundred sixty-one".