Base | Representation |
---|---|
bin | 101000100100100… |
… | …001111111100101 |
3 | 1202102210100221002 |
4 | 220210201333211 |
5 | 2343222240221 |
6 | 151313003045 |
7 | 22603362146 |
oct | 5044417745 |
9 | 1672710832 |
10 | 680665061 |
11 | 31a24380a |
12 | 16bb53485 |
13 | ab02c8bb |
14 | 66583acd |
15 | 3eb5380b |
hex | 28921fe5 |
680665061 has 16 divisors (see below), whose sum is σ = 736873200. Its totient is φ = 627314688.
The previous prime is 680665043. The next prime is 680665087. The reversal of 680665061 is 160566086.
680665061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 8300161 + 672364900 = 2881^2 + 25930^2 .
It is a cyclic number.
It is not a de Polignac number, because 680665061 - 222 = 676470757 is a prime.
It is a super-2 number, since 2×6806650612 = 926609850532267442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (680665021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50885 + ... + 62853.
It is an arithmetic number, because the mean of its divisors is an integer number (46054575).
Almost surely, 2680665061 is an apocalyptic number.
It is an amenable number.
680665061 is a deficient number, since it is larger than the sum of its proper divisors (56208139).
680665061 is a wasteful number, since it uses less digits than its factorization.
680665061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12088.
The product of its (nonzero) digits is 51840, while the sum is 38.
The square root of 680665061 is about 26089.5584669423. The cubic root of 680665061 is about 879.6525233679.
The spelling of 680665061 in words is "six hundred eighty million, six hundred sixty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •