Base | Representation |
---|---|
bin | 101000100011001… |
… | …101111000110110 |
3 | 1202102010212101000 |
4 | 220203031320312 |
5 | 2343130224231 |
6 | 151301344130 |
7 | 22600425612 |
oct | 5043157066 |
9 | 1672125330 |
10 | 680320566 |
11 | 31a028a02 |
12 | 16ba08046 |
13 | aac3bb63 |
14 | 664d4342 |
15 | 3ead66e6 |
hex | 288cde36 |
680320566 has 32 divisors (see below), whose sum is σ = 1516222080. Its totient is φ = 226113768.
The previous prime is 680320559. The next prime is 680320573. The reversal of 680320566 is 665023086.
680320566 is a `hidden beast` number, since 68 + 0 + 32 + 0 + 566 = 666.
680320566 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (680320559) and next prime (680320573).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 680320566.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 585 + ... + 36891.
It is an arithmetic number, because the mean of its divisors is an integer number (47381940).
Almost surely, 2680320566 is an apocalyptic number.
680320566 is an abundant number, since it is smaller than the sum of its proper divisors (835901514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
680320566 is a wasteful number, since it uses less digits than its factorization.
680320566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36665 (or 36659 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 680320566 is about 26082.9554690415. The cubic root of 680320566 is about 879.5040964585.
The spelling of 680320566 in words is "six hundred eighty million, three hundred twenty thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •