Search a number
-
+
115131601 = 1328131517
BaseRepresentation
bin1101101110011…
…00010011010001
322000122021212101
412313030103101
5213433202401
615231400401
72565413434
oct667142321
9260567771
10115131601
1159a97092
1232683101
131ab11010
141140d81b
15a193101
hex6dcc4d1

115131601 has 8 divisors (see below), whose sum is σ = 124433064. Its totient is φ = 105893760.

The previous prime is 115131589. The next prime is 115131671. The reversal of 115131601 is 106131511.

It can be written as a sum of positive squares in 4 ways, for example, as 641601 + 114490000 = 801^2 + 10700^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 115131601 - 27 = 115131473 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12106 + ... + 19411.

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

Almost surely, 2115131601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 31811.

The product of its (nonzero) digits is 90, while the sum is 19.

The square root of 115131601 is about 10729.9394686084. The cubic root of 115131601 is about 486.4798404568.

Subtracting from 115131601 its product of nonzero digits (90), we obtain a palindrome (115131511).

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

Divisors: 1 13 281 3653 31517 409721 8856277 115131601