Search a number
-
+
115905377 = 7196713007
BaseRepresentation
bin1101110100010…
…01001101100001
322002002121021202
412322021031201
5214132433002
615300130545
72605115360
oct672111541
9262077252
10115905377
115a475475
1232996a55
131b022283
14115717d7
15a297502
hex6e89361

115905377 has 16 divisors (see below), whose sum is σ = 141527040. Its totient is φ = 92706768.

The previous prime is 115905367. The next prime is 115905379. The reversal of 115905377 is 773509511.

It is not a de Polignac number, because 115905377 - 26 = 115905313 is a prime.

It is a Duffinian number.

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

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

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

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

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

Almost surely, 2115905377 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13100.

The product of its (nonzero) digits is 33075, while the sum is 38.

The square root of 115905377 is about 10765.9359555962. The cubic root of 115905377 is about 487.5672519098.

The spelling of 115905377 in words is "one hundred fifteen million, nine hundred five thousand, three hundred seventy-seven".

Divisors: 1 7 19 67 133 469 1273 8911 13007 91049 247133 871469 1729931 6100283 16557911 115905377