Search a number
-
+
117048515 = 5129118133
BaseRepresentation
bin1101111101000…
…00010011000011
322011020200101012
412332200103003
5214431023030
615340431135
72620616213
oct676402303
9264220335
10117048515
1160086311
12332484ab
131b33269c
141178c243
15a421095
hex6fa04c3

117048515 has 8 divisors (see below), whose sum is σ = 140574768. Its totient is φ = 93561120.

The previous prime is 117048511. The next prime is 117048557. The reversal of 117048515 is 515840711.

117048515 = T3943 + T3944 + ... + T3957.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 117048515 - 22 = 117048511 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2117048515 is an apocalyptic number.

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

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

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

The sum of its prime factors is 19429.

The product of its (nonzero) digits is 5600, while the sum is 32.

The square root of 117048515 is about 10818.8962006297. The cubic root of 117048515 is about 489.1649180347.

The spelling of 117048515 in words is "one hundred seventeen million, forty-eight thousand, five hundred fifteen".

Divisors: 1 5 1291 6455 18133 90665 23409703 117048515