Base | Representation |
---|---|
bin | 101000100010011… |
… | …010101000101101 |
3 | 1202101202012101212 |
4 | 220202122220231 |
5 | 2343102020022 |
6 | 151253044205 |
7 | 22565562563 |
oct | 5042325055 |
9 | 1671665355 |
10 | 680110637 |
11 | 3199a5208 |
12 | 16b926665 |
13 | aab9743b |
14 | 6647ba33 |
15 | 3ea943e2 |
hex | 2889aa2d |
680110637 has 2 divisors, whose sum is σ = 680110638. Its totient is φ = 680110636.
The previous prime is 680110547. The next prime is 680110663. The reversal of 680110637 is 736011086.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 676312036 + 3798601 = 26006^2 + 1949^2 .
It is a cyclic number.
It is not a de Polignac number, because 680110637 - 218 = 679848493 is a prime.
It is equal to p35275505 and since 680110637 and 35275505 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (680110037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 340055318 + 340055319.
It is an arithmetic number, because the mean of its divisors is an integer number (340055319).
Almost surely, 2680110637 is an apocalyptic number.
It is an amenable number.
680110637 is a deficient number, since it is larger than the sum of its proper divisors (1).
680110637 is an equidigital number, since it uses as much as digits as its factorization.
680110637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 680110637 is about 26078.9309021670. The cubic root of 680110637 is about 879.4136232223.
The spelling of 680110637 in words is "six hundred eighty million, one hundred ten thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •