Base | Representation |
---|---|
bin | 1101111101000… |
… | …01010011111110 |
3 | 22011020220002002 |
4 | 12332201103332 |
5 | 214431141140 |
6 | 15340502302 |
7 | 2620634300 |
oct | 676412376 |
9 | 264226062 |
10 | 117052670 |
11 | 60089449 |
12 | 3324a992 |
13 | 1b334547 |
14 | 1178d970 |
15 | a422415 |
hex | 6fa14fe |
117052670 has 24 divisors (see below), whose sum is σ = 245094984. Its totient is φ = 40132176.
The previous prime is 117052657. The next prime is 117052679. The reversal of 117052670 is 76250711.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117052679) 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, 118952 + ... + 119931.
It is an arithmetic number, because the mean of its divisors is an integer number (10212291).
Almost surely, 2117052670 is an apocalyptic number.
117052670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
117052670 is an abundant number, since it is smaller than the sum of its proper divisors (128042314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117052670 is a wasteful number, since it uses less digits than its factorization.
117052670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238904 (or 238897 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 29.
The square root of 117052670 is about 10819.0882240603. The cubic root of 117052670 is about 489.1707061081.
The spelling of 117052670 in words is "one hundred seventeen million, fifty-two thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •