Base | Representation |
---|---|
bin | 10000001010101110… |
… | …00010111011101101 |
3 | 211101220200200020021 |
4 | 20011113002323231 |
5 | 120234021040442 |
6 | 3553143322141 |
7 | 425044416052 |
oct | 100527027355 |
9 | 24356620207 |
10 | 8679861997 |
11 | 3754612874 |
12 | 1822a50351 |
13 | a84351321 |
14 | 5c4abd029 |
15 | 35c040e67 |
hex | 2055c2eed |
8679861997 has 2 divisors, whose sum is σ = 8679861998. Its totient is φ = 8679861996.
The previous prime is 8679861977. The next prime is 8679862001. The reversal of 8679861997 is 7991689768.
8679861997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8509324516 + 170537481 = 92246^2 + 13059^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8679861997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8679861977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4339930998 + 4339930999.
It is an arithmetic number, because the mean of its divisors is an integer number (4339930999).
Almost surely, 28679861997 is an apocalyptic number.
It is an amenable number.
8679861997 is a deficient number, since it is larger than the sum of its proper divisors (1).
8679861997 is an equidigital number, since it uses as much as digits as its factorization.
8679861997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 82301184, while the sum is 70.
The square root of 8679861997 is about 93165.7769623589. The cubic root of 8679861997 is about 2055.1219923514.
The spelling of 8679861997 in words is "eight billion, six hundred seventy-nine million, eight hundred sixty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •