Base | Representation |
---|---|
bin | 110110101001101110… |
… | …0111010110101110000 |
3 | 102012221022110110012000 |
4 | 1231103130322311300 |
5 | 3410330214110320 |
6 | 125525534134000 |
7 | 11323252204410 |
oct | 1552334726560 |
9 | 365838413160 |
10 | 117364206960 |
11 | 45857042870 |
12 | 1a8b5051300 |
13 | b0b50c1710 |
14 | 5975268640 |
15 | 30bd8a4c90 |
hex | 1b5373ad70 |
117364206960 has 2560 divisors, whose sum is σ = 599001661440. Its totient is φ = 20304691200.
The previous prime is 117364206919. The next prime is 117364207031. The reversal of 117364206960 is 69602463711.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 1139458269 + ... + 1139458371.
It is an arithmetic number, because the mean of its divisors is an integer number (233985024).
Almost surely, 2117364206960 is an apocalyptic number.
117364206960 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 117364206960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (299500830720).
117364206960 is an abundant number, since it is smaller than the sum of its proper divisors (481637454480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117364206960 is a wasteful number, since it uses less digits than its factorization.
117364206960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 45.
The spelling of 117364206960 in words is "one hundred seventeen billion, three hundred sixty-four million, two hundred six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •