1163694853151 has 2 divisors, whose sum is σ = 1163694853152. Its totient is φ = 1163694853150.

The previous prime is 1163694853093. The next prime is 1163694853159. The reversal of 1163694853151 is 1513584963611.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1163694853151² (a number of 25 digits) contains 22 as substring.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its digits is 2332800, while the sum is 53.

The spelling of 1163694853151 in words is "one trillion, one hundred sixty-three billion, six hundred ninety-four million, eight hundred fifty-three thousand, one hundred fifty-one".