Base | Representation |
---|---|
bin | 1110000000110… |
… | …11011001000100 |
3 | 22012012022000000 |
4 | 13000123121010 |
5 | 220043141313 |
6 | 15355321300 |
7 | 2625116160 |
oct | 700333104 |
9 | 265168000 |
10 | 117552708 |
11 | 603a00a9 |
12 | 33450230 |
13 | 1b47b020 |
14 | 1187dca0 |
15 | a4c0673 |
hex | 701b644 |
117552708 has 168 divisors, whose sum is σ = 380468928. Its totient is φ = 30932928.
The previous prime is 117552667. The next prime is 117552733. The reversal of 117552708 is 807255711.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 265135 + ... + 265577.
It is an arithmetic number, because the mean of its divisors is an integer number (2264696).
Almost surely, 2117552708 is an apocalyptic number.
117552708 is a gapful number since it is divisible by the number (18) 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 117552708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190234464).
117552708 is an abundant number, since it is smaller than the sum of its proper divisors (262916220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117552708 is a wasteful number, since it uses less digits than its factorization.
117552708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485 (or 468 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 36.
The square root of 117552708 is about 10842.1726604957. The cubic root of 117552708 is about 489.8662803240.
The spelling of 117552708 in words is "one hundred seventeen million, five hundred fifty-two thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •