Base | Representation |
---|---|
bin | 110110110001001010… |
… | …0010101111000000000 |
3 | 102020120200202202221120 |
4 | 1231202110111320000 |
5 | 3411333041213030 |
6 | 130010403552240 |
7 | 11332401150342 |
oct | 1554224257000 |
9 | 366520682846 |
10 | 117613616640 |
11 | 45974902a73 |
12 | 1a96468b680 |
13 | b124988500 |
14 | 599a42d292 |
15 | 30d571e010 |
hex | 1b62515e00 |
117613616640 has 240 divisors, whose sum is σ = 407148123888. Its totient is φ = 28950724608.
The previous prime is 117613616621. The next prime is 117613616651. The reversal of 117613616640 is 46616316711.
It is a tau number, because it is divible by the number of its divisors (240).
It is a junction number, because it is equal to n+sod(n) for n = 117613616592 and 117613616601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1252612 + ... + 1343228.
Almost surely, 2117613616640 is an apocalyptic number.
117613616640 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 117613616640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203574061944).
117613616640 is an abundant number, since it is smaller than the sum of its proper divisors (289534507248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117613616640 is an equidigital number, since it uses as much as digits as its factorization.
117613616640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90669 (or 90640 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 42.
The spelling of 117613616640 in words is "one hundred seventeen billion, six hundred thirteen million, six hundred sixteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •