Search a number
-
+
115159000 = 23531119229
BaseRepresentation
bin1101101110100…
…10111111011000
322000200200110011
412313102333120
5213440042000
615232131304
72565556345
oct667227730
9260620404
10115159000
115a005730
1232696b34
131ab20628
14114197cc
15a19b2ba
hex6dd2fd8

115159000 has 192 divisors, whose sum is σ = 320954400. Its totient is φ = 38304000.

The previous prime is 115158991. The next prime is 115159027. The reversal of 115159000 is 951511.

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

It is a congruent number.

It is an unprimeable number.

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 47 ways as a sum of consecutive naturals, for example, 3970986 + ... + 3971014.

Almost surely, 2115159000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 225, while the sum is 22.

The square root of 115159000 is about 10731.2161472966. The cubic root of 115159000 is about 486.5184281941.

The spelling of 115159000 in words is "one hundred fifteen million, one hundred fifty-nine thousand".