Base | Representation |
---|---|
bin | 1100011100011011… |
… | …01010010000111101 |
3 | 122020121022112122122 |
4 | 12032031222100331 |
5 | 102140303203312 |
6 | 3022535052325 |
7 | 324362552225 |
oct | 61615522075 |
9 | 18217275578 |
10 | 6680912957 |
11 | 2919223874 |
12 | 13655110a5 |
13 | 826184444 |
14 | 475419085 |
15 | 2917d9b72 |
hex | 18e36a43d |
6680912957 has 2 divisors, whose sum is σ = 6680912958. Its totient is φ = 6680912956.
The previous prime is 6680912929. The next prime is 6680912963. The reversal of 6680912957 is 7592190866.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5408278681 + 1272634276 = 73541^2 + 35674^2 .
It is a cyclic number.
It is not a de Polignac number, because 6680912957 - 28 = 6680912701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6680912899 and 6680912908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6680912657) 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, 3340456478 + 3340456479.
It is an arithmetic number, because the mean of its divisors is an integer number (3340456479).
Almost surely, 26680912957 is an apocalyptic number.
It is an amenable number.
6680912957 is a deficient number, since it is larger than the sum of its proper divisors (1).
6680912957 is an equidigital number, since it uses as much as digits as its factorization.
6680912957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The square root of 6680912957 is about 81736.8518906864. The cubic root of 6680912957 is about 1883.4117311941.
The spelling of 6680912957 in words is "six billion, six hundred eighty million, nine hundred twelve thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •