Base | Representation |
---|---|
bin | 10011101100010111101110… |
… | …000100001100101001101111 |
3 | 102100200000201212102121100102 |
4 | 103230113232010030221233 |
5 | 42323022343424223042 |
6 | 504113001413221315 |
7 | 24146340224323445 |
oct | 2354275604145157 |
9 | 370600655377312 |
10 | 86612009601647 |
11 | 25662a464a4602 |
12 | 9869ba293183b |
13 | 3943628c9647a |
14 | 1756087a24b95 |
15 | a02e9cc59b32 |
hex | 4ec5ee10ca6f |
86612009601647 has 4 divisors (see below), whose sum is σ = 86620316124936. Its totient is φ = 86603703078360.
The previous prime is 86612009601629. The next prime is 86612009601659. The reversal of 86612009601647 is 74610690021668.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 86612009601647 - 230 = 86610935859823 is a prime.
It is a super-2 number, since 2×866120096016472 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86612009601592 and 86612009601601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86612009601847) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4153246004 + ... + 4153266857.
It is an arithmetic number, because the mean of its divisors is an integer number (21655079031234).
Almost surely, 286612009601647 is an apocalyptic number.
86612009601647 is a deficient number, since it is larger than the sum of its proper divisors (8306523289).
86612009601647 is a wasteful number, since it uses less digits than its factorization.
86612009601647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8306523288.
The product of its (nonzero) digits is 5225472, while the sum is 56.
The spelling of 86612009601647 in words is "eighty-six trillion, six hundred twelve billion, nine million, six hundred one thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •