Base | Representation |
---|---|
bin | 10000101100111010… |
… | …01101010011001101 |
3 | 212010220102001021112 |
4 | 20112131031103031 |
5 | 121330433034442 |
6 | 4041431141405 |
7 | 435126415226 |
oct | 102635152315 |
9 | 25126361245 |
10 | 8966689997 |
11 | 389150aa01 |
12 | 18a2b14865 |
13 | acb8b9835 |
14 | 610c2424d |
15 | 3772ec082 |
hex | 21674d4cd |
8966689997 has 2 divisors, whose sum is σ = 8966689998. Its totient is φ = 8966689996.
The previous prime is 8966689973. The next prime is 8966690027. The reversal of 8966689997 is 7999866698.
8966689997 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8704703401 + 261986596 = 93299^2 + 16186^2 .
It is a cyclic number.
It is not a de Polignac number, because 8966689997 - 212 = 8966685901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8966680997) 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, 4483344998 + 4483344999.
It is an arithmetic number, because the mean of its divisors is an integer number (4483344999).
Almost surely, 28966689997 is an apocalyptic number.
It is an amenable number.
8966689997 is a deficient number, since it is larger than the sum of its proper divisors (1).
8966689997 is an equidigital number, since it uses as much as digits as its factorization.
8966689997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 634894848, while the sum is 77.
The square root of 8966689997 is about 94692.6079321929. The cubic root of 8966689997 is about 2077.5144432387.
The spelling of 8966689997 in words is "eight billion, nine hundred sixty-six million, six hundred eighty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •