Base | Representation |
---|---|
bin | 11010100001110010110111… |
… | …100001100111100000110010 |
3 | 120022002200201100210012211210 |
4 | 122201302313201213200302 |
5 | 110243021334042443131 |
6 | 1052050102445020550 |
7 | 33401146166535303 |
oct | 3241626741474062 |
9 | 508080640705753 |
10 | 116671570671666 |
11 | 341a215402806a |
12 | 11103894b54756 |
13 | 501410ac407ca |
14 | 20b4d114487aa |
15 | d74d66983146 |
hex | 6a1cb7867832 |
116671570671666 has 16 divisors (see below), whose sum is σ = 238307889032064. Its totient is φ = 38063065609104.
The previous prime is 116671570671647. The next prime is 116671570671739. The reversal of 116671570671666 is 666176075176611.
It is a happy number.
It is a super-2 number, since 2×1166715706716662 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116671570671597 and 116671570671606.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206864486725 + ... + 206864487288.
It is an arithmetic number, because the mean of its divisors is an integer number (14894243064504).
Almost surely, 2116671570671666 is an apocalyptic number.
116671570671666 is an abundant number, since it is smaller than the sum of its proper divisors (121636318360398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116671570671666 is a wasteful number, since it uses less digits than its factorization.
116671570671666 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413728974065.
The product of its (nonzero) digits is 80015040, while the sum is 66.
The spelling of 116671570671666 in words is "one hundred sixteen trillion, six hundred seventy-one billion, five hundred seventy million, six hundred seventy-one thousand, six hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •