Base | Representation |
---|---|
bin | 1101111110100… |
… | …10001001001000 |
3 | 22011122001102212 |
4 | 12333102021020 |
5 | 220004041210 |
6 | 15345044252 |
7 | 2622426356 |
oct | 677221110 |
9 | 264561385 |
10 | 117252680 |
11 | 60205746 |
12 | 33326688 |
13 | 1b3a45ac |
14 | 118027d6 |
15 | a461805 |
hex | 6fd2248 |
117252680 has 48 divisors (see below), whose sum is σ = 268225020. Its totient is φ = 46130304.
The previous prime is 117252677. The next prime is 117252703. The reversal of 117252680 is 86252711.
It can be written as a sum of positive squares in 2 ways, for example, as 112063396 + 5189284 = 10586^2 + 2278^2 .
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 179234 + ... + 179886.
Almost surely, 2117252680 is an apocalyptic number.
117252680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117252680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134112510).
117252680 is an abundant number, since it is smaller than the sum of its proper divisors (150972340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117252680 is an equidigital number, since it uses as much as digits as its factorization.
117252680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798 (or 727 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 117252680 is about 10828.3276640486. The cubic root of 117252680 is about 489.4491658229.
The spelling of 117252680 in words is "one hundred seventeen million, two hundred fifty-two thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •