Base | Representation |
---|---|
bin | 1110000000010… |
… | …10100000101000 |
3 | 22012001210010222 |
4 | 13000022200220 |
5 | 220033433220 |
6 | 15354025212 |
7 | 2624410445 |
oct | 700124050 |
9 | 265053128 |
10 | 117483560 |
11 | 60353157 |
12 | 33418208 |
13 | 1b4556cc |
14 | 118629cc |
15 | a4a9e25 |
hex | 700a828 |
117483560 has 64 divisors (see below), whose sum is σ = 272192400. Its totient is φ = 45619200.
The previous prime is 117483529. The next prime is 117483577. The reversal of 117483560 is 65384711.
It can be written as a sum of positive squares in 8 ways, for example, as 4401604 + 113081956 = 2098^2 + 10634^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 117483560.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 216890 + ... + 217430.
Almost surely, 2117483560 is an apocalyptic number.
117483560 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 117483560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136096200).
117483560 is an abundant number, since it is smaller than the sum of its proper divisors (154708840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117483560 is a wasteful number, since it uses less digits than its factorization.
117483560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 702 (or 698 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 35.
The square root of 117483560 is about 10838.9833471595. The cubic root of 117483560 is about 489.7702101780.
The spelling of 117483560 in words is "one hundred seventeen million, four hundred eighty-three thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •