115050005150159 has 4 divisors (see below), whose sum is σ = 115055499703080. Its totient is φ = 115044510597240.

The previous prime is 115050005150147. The next prime is 115050005150173. The reversal of 115050005150159 is 951051500050511.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115050005150189) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2747245052 + ... + 2747286929.

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

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

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

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

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

The sum of its prime factors is 5494552920.

The product of its (nonzero) digits is 28125, while the sum is 38.

The spelling of 115050005150159 in words is "one hundred fifteen trillion, fifty billion, five million, one hundred fifty thousand, one hundred fifty-nine".