Search a number
-
+
115116511161 = 3674391304599
BaseRepresentation
bin110101100110101111…
…0101000111110111001
3102000010200000200012110
41223031132220332321
53341224311324121
6124514522202533
711213460125421
oct1531536507671
9360120020173
10115116511161
11449032a6733
121a388353449
13ab175306c2
145800933481
152edb3b5d76
hex1acd7a8fb9

115116511161 has 16 divisors (see below), whose sum is σ = 156134528000. Its totient is φ = 75426637968.

The previous prime is 115116511099. The next prime is 115116511187. The reversal of 115116511161 is 161115611511.

It is a happy number.

It is not a de Polignac number, because 115116511161 - 210 = 115116510137 is a prime.

It is a super-2 number, since 2×1151165111612 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 564061 + ... + 740538.

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

Almost surely, 2115116511161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1305108.

The product of its digits is 900, while the sum is 30.

The spelling of 115116511161 in words is "one hundred fifteen billion, one hundred sixteen million, five hundred eleven thousand, one hundred sixty-one".

Divisors: 1 3 67 201 439 1317 29413 88239 1304599 3913797 87408133 262224399 572718961 1718156883 38372170387 115116511161