1115167680131 has 2 divisors, whose sum is σ = 1115167680132. Its totient is φ = 1115167680130.

The previous prime is 1115167680113. The next prime is 1115167680269. The reversal of 1115167680131 is 1310867615111.

Together with previous prime (1115167680113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1115167680131 is a prime.

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

It is a Sophie Germain prime.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 30240, while the sum is 41.

The spelling of 1115167680131 in words is "one trillion, one hundred fifteen billion, one hundred sixty-seven million, six hundred eighty thousand, one hundred thirty-one".