Search a number
-
+
115151157 = 32111163143
BaseRepresentation
bin1101101110100…
…01000100110101
322000200021200200
412313101010311
5213434314112
615232031113
72565524442
oct667210465
9260607620
10115151157
1159aaa850
1232692499
131ab19ba4
14114169c9
15a198cdc
hex6dd1135

115151157 has 12 divisors (see below), whose sum is σ = 181450464. Its totient is φ = 69788520.

The previous prime is 115151117. The next prime is 115151159. The reversal of 115151157 is 751151511.

It is a happy number.

It is not a de Polignac number, because 115151157 - 28 = 115150901 is a prime.

It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.

It is a self number, because there is not a number n which added to its sum of digits gives 115151157.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115151159) 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, 581473 + ... + 581670.

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

Almost surely, 2115151157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 875, while the sum is 27.

The square root of 115151157 is about 10730.8507118495. The cubic root of 115151157 is about 486.5073830286.

The spelling of 115151157 in words is "one hundred fifteen million, one hundred fifty-one thousand, one hundred fifty-seven".

Divisors: 1 3 9 11 33 99 1163143 3489429 10468287 12794573 38383719 115151157