11567048951 has 2 divisors, whose sum is σ = 11567048952. Its totient is φ = 11567048950.

The previous prime is 11567048929. The next prime is 11567048959. The reversal of 11567048951 is 15984076511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11567048951 - 2²⁶ = 11499940087 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11567048959) 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 as a sum of consecutive naturals, namely, 5783524475 + 5783524476.

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

Almost surely, 2^11567048951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 302400, while the sum is 47.

The spelling of 11567048951 in words is "eleven billion, five hundred sixty-seven million, forty-eight thousand, nine hundred fifty-one".