Search a number
-
+
115609145 = 5101228929
BaseRepresentation
bin1101110010000…
…00111000111001
322001112112221012
412321000320321
5214043443040
615245523305
72602442621
oct671007071
9261475835
10115609145
115a292953
1232873535
131ac4a4a2
14114d5881
15a239865
hex6e40e39

115609145 has 8 divisors (see below), whose sum is σ = 140105160. Its totient is φ = 91571200.

The previous prime is 115609133. The next prime is 115609147. The reversal of 115609145 is 541906511.

It can be written as a sum of positive squares in 4 ways, for example, as 47183161 + 68425984 = 6869^2 + 8272^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 115609145 - 216 = 115543609 is a prime.

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

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

Almost surely, 2115609145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 229035.

The product of its (nonzero) digits is 5400, while the sum is 32.

The square root of 115609145 is about 10752.1693160032. The cubic root of 115609145 is about 487.1515212835.

The spelling of 115609145 in words is "one hundred fifteen million, six hundred nine thousand, one hundred forty-five".

Divisors: 1 5 101 505 228929 1144645 23121829 115609145