Base | Representation |
---|---|
bin | 111111010110010111010… |
… | …1000011010011101010001 |
3 | 1010211100110120110120011211 |
4 | 1332230232220122131101 |
5 | 2120122240322230212 |
6 | 30303443303340121 |
7 | 1556015446606336 |
oct | 176545650323521 |
9 | 33740416416154 |
10 | 8706681055057 |
11 | 2857534522437 |
12 | b874b5a51641 |
13 | 4b20622650cb |
14 | 221596dd898d |
15 | 1017328349a7 |
hex | 7eb2ea1a751 |
8706681055057 has 8 divisors (see below), whose sum is σ = 9254709736776. Its totient is φ = 8162638036992.
The previous prime is 8706681055049. The next prime is 8706681055117. The reversal of 8706681055057 is 7505501866078.
It can be written as a sum of positive squares in 4 ways, for example, as 6367466811456 + 2339214243601 = 2523384^2 + 1529449^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 8706681055057 - 23 = 8706681055049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8706681054992 and 8706681055010.
It is not an unprimeable number, because it can be changed into a prime (8706681059057) 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, 996411408 + ... + 996420145.
It is an arithmetic number, because the mean of its divisors is an integer number (1156838717097).
Almost surely, 28706681055057 is an apocalyptic number.
It is an amenable number.
8706681055057 is a deficient number, since it is larger than the sum of its proper divisors (548028681719).
8706681055057 is a wasteful number, since it uses less digits than its factorization.
8706681055057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1992831827.
The product of its (nonzero) digits is 14112000, while the sum is 58.
The spelling of 8706681055057 in words is "eight trillion, seven hundred six billion, six hundred eighty-one million, fifty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •