Search a number
-
+
115238970 = 233571123241
BaseRepresentation
bin1101101111001…
…10100000111010
322000211202011000
412313212200322
5214000121340
615233545430
72566341450
oct667464072
9260752130
10115238970
115a05a820
1232715276
131ab4ab52
141143a9d0
15a1b4d30
hex6de683a

115238970 has 256 divisors, whose sum is σ = 401448960. Its totient is φ = 22809600.

The previous prime is 115238969. The next prime is 115239031. The reversal of 115238970 is 79832511.

It is a Curzon number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 478050 + ... + 478290.

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

Almost surely, 2115238970 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 115238970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200724480).

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

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

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

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

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

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

The square root of 115238970 is about 10734.9415461846. The cubic root of 115238970 is about 486.6310199908.

The spelling of 115238970 in words is "one hundred fifteen million, two hundred thirty-eight thousand, nine hundred seventy".