Search a number
-
+
115146261 = 3235473607
BaseRepresentation
bin1101101110011…
…11111000010101
322000200000222100
412313033320111
5213434140021
615231552313
72565504246
oct667177025
9260600870
10115146261
1159aa70aa
123268b699
131ab178a9
1411414ccd
15a197626
hex6dcfe15

115146261 has 12 divisors (see below), whose sum is σ = 166415392. Its totient is φ = 76721256.

The previous prime is 115146259. The next prime is 115146271. The reversal of 115146261 is 162641511.

It is not a de Polignac number, because 115146261 - 21 = 115146259 is a prime.

It is a super-3 number, since 3×1151462613 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

It is a congruent number.

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

Almost surely, 2115146261 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 115146261 is about 10730.6225821245. The cubic root of 115146261 is about 486.5004878195.

Adding to 115146261 its reverse (162641511), we get a palindrome (277787772).

The spelling of 115146261 in words is "one hundred fifteen million, one hundred forty-six thousand, two hundred sixty-one".

Divisors: 1 3 9 3547 3607 10641 10821 31923 32463 12794029 38382087 115146261