Base | Representation |
---|---|
bin | 1110000001101… |
… | …01101001100000 |
3 | 22012101202112021 |
4 | 13000311221200 |
5 | 220110112011 |
6 | 15401511224 |
7 | 2626044550 |
oct | 700655140 |
9 | 265352467 |
10 | 117660256 |
11 | 6046398a |
12 | 334a2514 |
13 | 1b4b7c6c |
14 | 118ab160 |
15 | a4e2471 |
hex | 7035a60 |
117660256 has 48 divisors (see below), whose sum is σ = 265730976. Its totient is φ = 50236416.
The previous prime is 117660227. The next prime is 117660269. The reversal of 117660256 is 652066711.
It is a happy number.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 70180 + ... + 71836.
It is an arithmetic number, because the mean of its divisors is an integer number (5536062).
Almost surely, 2117660256 is an apocalyptic number.
117660256 is a gapful number since it is divisible by the number (16) 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 117660256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132865488).
117660256 is an abundant number, since it is smaller than the sum of its proper divisors (148070720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117660256 is a wasteful number, since it uses less digits than its factorization.
117660256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1991 (or 1983 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 117660256 is about 10847.1312336488. The cubic root of 117660256 is about 490.0156263238.
The spelling of 117660256 in words is "one hundred seventeen million, six hundred sixty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •