Search a number
-
+
115109361 = 3219964271
BaseRepresentation
bin1101101110001…
…10110111110001
322000121011100200
412313012313301
5213431444421
615231105413
72565261543
oct667066761
9260534320
10115109361
1159a81404
1232672269
131ab03b63
1411405693
15a18b726
hex6dc6df1

115109361 has 12 divisors (see below), whose sum is σ = 167107200. Its totient is φ = 76352760.

The previous prime is 115109347. The next prime is 115109377. The reversal of 115109361 is 163901511.

115109361 is a `hidden beast` number, since 1 + 1 + 510 + 93 + 61 = 666.

It is not a de Polignac number, because 115109361 - 27 = 115109233 is a prime.

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

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

Almost surely, 2115109361 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 810, while the sum is 27.

The square root of 115109361 is about 10728.9030660175. The cubic root of 115109361 is about 486.4485139623.

The spelling of 115109361 in words is "one hundred fifteen million, one hundred nine thousand, three hundred sixty-one".

Divisors: 1 3 9 199 597 1791 64271 192813 578439 12789929 38369787 115109361