1151055161051 has 2 divisors, whose sum is σ = 1151055161052. Its totient is φ = 1151055161050.

The previous prime is 1151055160943. The next prime is 1151055161099. The reversal of 1151055161051 is 1501615501511.

It is a strong prime.

It is an emirp because it is prime and its reverse (1501615501511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1151055161051 - 2³⁰ = 1149981419227 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1151055161651) 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, 575527580525 + 575527580526.

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

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

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

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

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

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

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