Base | Representation |
---|---|
bin | 110110110010100110… |
… | …0111010001001000000 |
3 | 102020201001210220000000 |
4 | 1231211030322021000 |
5 | 3411432432442210 |
6 | 130015253000000 |
7 | 11333526331641 |
oct | 1554514721100 |
9 | 366631726000 |
10 | 117661999680 |
11 | 4599a149955 |
12 | 1a978923000 |
13 | b1319c8924 |
14 | 59a2a256c8 |
15 | 30d9ac9ac0 |
hex | 1b6533a240 |
117661999680 has 224 divisors, whose sum is σ = 420212398080. Its totient is φ = 31376346624.
The previous prime is 117661999601. The next prime is 117661999709. The reversal of 117661999680 is 86999166711.
117661999680 is a `hidden beast` number, since 1 + 1 + 7 + 6 + 619 + 9 + 9 + 6 + 8 + 0 = 666.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 615777 + ... + 783903.
Almost surely, 2117661999680 is an apocalyptic number.
117661999680 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 117661999680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210106199040).
117661999680 is an abundant number, since it is smaller than the sum of its proper divisors (302550398400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117661999680 is an frugal number, since it uses more digits than its factorization.
117661999680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168165 (or 168137 counting only the distinct ones).
The product of its (nonzero) digits is 8817984, while the sum is 63.
The spelling of 117661999680 in words is "one hundred seventeen billion, six hundred sixty-one million, nine hundred ninety-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •