Search a number
-
+
115767483 = 313109113241
BaseRepresentation
bin1101110011001…
…11100010111011
322001211121010120
412321213202323
5214114024413
615253144323
72604002346
oct671474273
9261747116
10115767483
115a390907
123292b0a3
131aca4590
141153745d
15a26b723
hex6e678bb

115767483 has 32 divisors (see below), whose sum is σ = 169942080. Its totient is φ = 69672960.

The previous prime is 115767479. The next prime is 115767511. The reversal of 115767483 is 384767511.

It is not a de Polignac number, because 115767483 - 22 = 115767479 is a prime.

It is a super-2 number, since 2×1157674832 = 26804220240310578, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (115767083) 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 31 ways as a sum of consecutive naturals, for example, 480243 + ... + 480483.

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

Almost surely, 2115767483 is an apocalyptic number.

115767483 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

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

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

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

The sum of its prime factors is 479.

The product of its digits is 141120, while the sum is 42.

The square root of 115767483 is about 10759.5298689116. The cubic root of 115767483 is about 487.3738203352.

The spelling of 115767483 in words is "one hundred fifteen million, seven hundred sixty-seven thousand, four hundred eighty-three".

Divisors: 1 3 13 39 109 113 241 327 339 723 1417 1469 3133 4251 4407 9399 12317 26269 27233 36951 78807 81699 160121 341497 354029 480363 1024491 1062087 2968397 8905191 38589161 115767483