Base | Representation |
---|---|
bin | 110110110111111011… |
… | …0110110101011000000 |
3 | 102021011112012020121001 |
4 | 1231233312312223000 |
5 | 3412314214031210 |
6 | 130045120341344 |
7 | 11341126666306 |
oct | 1555766665300 |
9 | 367145166531 |
10 | 117840767680 |
11 | 45a8104a9a9 |
12 | 1aa08774854 |
13 | b15ca5aacc |
14 | 59bc67c276 |
15 | 30ea63d03a |
hex | 1b6fdb6ac0 |
117840767680 has 56 divisors (see below), whose sum is σ = 280994863968. Its totient is φ = 47071377408.
The previous prime is 117840767647. The next prime is 117840767687. The reversal of 117840767680 is 86767048711.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (117840767687) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20629 + ... + 485908.
It is an arithmetic number, because the mean of its divisors is an integer number (5017765428).
Almost surely, 2117840767680 is an apocalyptic number.
117840767680 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 117840767680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140497431984).
117840767680 is an abundant number, since it is smaller than the sum of its proper divisors (163154096288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117840767680 is an equidigital number, since it uses as much as digits as its factorization.
117840767680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507281 (or 507271 counting only the distinct ones).
The product of its (nonzero) digits is 3161088, while the sum is 55.
The spelling of 117840767680 in words is "one hundred seventeen billion, eight hundred forty million, seven hundred sixty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •