115215101 has 6 divisors (see below), whose sum is σ = 116698302. Its totient is φ = 113750520.

The previous prime is 115215049. The next prime is 115215109. The reversal of 115215101 is 101512511.

It can be written as a sum of positive squares in only one way, i.e., 70123876 + 45091225 = 8374^2 + 6715^2 .

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 115215101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115215109) 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 in 5 ways as a sum of consecutive naturals, for example, 2990 + ... + 15471.

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

Almost surely, 2^115215101 is an apocalyptic number.

It is an amenable number.

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

115215101 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 18619 (or 18540 counting only the distinct ones).

The product of its (nonzero) digits is 50, while the sum is 17.

The square root of 115215101 is about 10733.8297452494. The cubic root of 115215101 is about 486.5974196735.

Adding to 115215101 its reverse (101512511), we get a palindrome (216727612).

The spelling of 115215101 in words is "one hundred fifteen million, two hundred fifteen thousand, one hundred one".