15050101115137 has 4 divisors (see below), whose sum is σ = 16418292125616. Its totient is φ = 13681910104660.

The previous prime is 15050101115087. The next prime is 15050101115141. The reversal of 15050101115137 is 73151110105051.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 15050101115137 - 2¹⁹ = 15050100590849 is a prime.

It is a Duffinian number.

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

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

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

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

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

It is an amenable number.

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

15050101115137 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1368191010478.

The product of its (nonzero) digits is 2625, while the sum is 31.

The spelling of 15050101115137 in words is "fifteen trillion, fifty billion, one hundred one million, one hundred fifteen thousand, one hundred thirty-seven".