Search a number
-
+
115690131 = 3283154873
BaseRepresentation
bin1101110010101…
…00101010010011
322001200200000200
412321110222103
5214104041011
615251350243
72603231004
oct671245223
9261620020
10115690131
115a338787
12328b2383
131ac782cb
14115171ab
15a253856
hex6e54a93

115690131 has 12 divisors (see below), whose sum is σ = 169122408. Its totient is φ = 76197024.

The previous prime is 115690111. The next prime is 115690139. The reversal of 115690131 is 131096511.

It is not a de Polignac number, because 115690131 - 26 = 115690067 is a prime.

It is a super-2 number, since 2×1156901312 = 26768412821594322, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 115690095 and 115690104.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 76690 + ... + 78183.

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

Almost surely, 2115690131 is an apocalyptic number.

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

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

115690131 is an evil number, because the sum of its binary digits is even.

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

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

The square root of 115690131 is about 10755.9346874179. The cubic root of 115690131 is about 487.2652471320.

The spelling of 115690131 in words is "one hundred fifteen million, six hundred ninety thousand, one hundred thirty-one".

Divisors: 1 3 9 83 249 747 154873 464619 1393857 12854459 38563377 115690131