11547215051 has 2 divisors, whose sum is σ = 11547215052. Its totient is φ = 11547215050.

The previous prime is 11547215047. The next prime is 11547215063. The reversal of 11547215051 is 15051274511.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11547215051 - 2² = 11547215047 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11547214999 and 11547215017.

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

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

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

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

Almost surely, 2^11547215051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7000, while the sum is 32.

Adding to 11547215051 its reverse (15051274511), we get a palindrome (26598489562).

The spelling of 11547215051 in words is "eleven billion, five hundred forty-seven million, two hundred fifteen thousand, fifty-one".