Search a number
-
+
115152065 = 5719434027
BaseRepresentation
bin1101101110100…
…01010011000001
322000200022221022
412313101103001
5213434331230
615232035225
72565530210
oct667212301
9260608838
10115152065
115a0004a6
1232692b15
131ab1a422
1411417077
15a1991e5
hex6dd14c1

115152065 has 32 divisors (see below), whose sum is σ = 170142720. Its totient is φ = 73047744.

The previous prime is 115152061. The next prime is 115152077. The reversal of 115152065 is 560251511.

It is not a de Polignac number, because 115152065 - 22 = 115152061 is a prime.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26582 + ... + 30608.

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

Almost surely, 2115152065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4101.

The product of its (nonzero) digits is 1500, while the sum is 26.

The square root of 115152065 is about 10730.8930196885. The cubic root of 115152065 is about 486.5086617754.

The spelling of 115152065 in words is "one hundred fifteen million, one hundred fifty-two thousand, sixty-five".

Divisors: 1 5 7 19 35 43 95 133 215 301 665 817 1505 4027 4085 5719 20135 28189 28595 76513 140945 173161 382565 535591 865805 1212127 2677955 3290059 6060635 16450295 23030413 115152065