115469270 has 64 divisors (see below), whose sum is σ = 264798720. Its totient is φ = 35292672.

The previous prime is 115469257. The next prime is 115469273. The reversal of 115469270 is 72964511.

It is a Harshad number since it is a multiple of its sum of digits (35).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115469273) 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 31 ways as a sum of consecutive naturals, for example, 20057 + ... + 25163.

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

Almost surely, 2^115469270 is an apocalyptic number.

115469270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

115469270 is an abundant number, since it is smaller than the sum of its proper divisors (149329450).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 5157.

The product of its (nonzero) digits is 15120, while the sum is 35.

The square root of 115469270 is about 10745.6628460044. The cubic root of 115469270 is about 486.9549744953.

The spelling of 115469270 in words is "one hundred fifteen million, four hundred sixty-nine thousand, two hundred seventy".