Base | Representation |
---|---|
bin | 101000100100000… |
… | …100101110010001 |
3 | 1202102120021110122 |
4 | 220210010232101 |
5 | 2343204421134 |
6 | 151310240025 |
7 | 22602352463 |
oct | 5044045621 |
9 | 1672507418 |
10 | 680545169 |
11 | 31a171727 |
12 | 16bab6015 |
13 | aacba165 |
14 | 66552133 |
15 | 3eb2d02e |
hex | 28904b91 |
680545169 has 2 divisors, whose sum is σ = 680545170. Its totient is φ = 680545168.
The previous prime is 680545163. The next prime is 680545193. The reversal of 680545169 is 961545086.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 352500625 + 328044544 = 18775^2 + 18112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-680545169 is a prime.
It is a super-2 number, since 2×6805451692 = 926283454098477122, which contains 22 as substring.
It is equal to p35296865 and since 680545169 and 35296865 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (680545163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 340272584 + 340272585.
It is an arithmetic number, because the mean of its divisors is an integer number (340272585).
Almost surely, 2680545169 is an apocalyptic number.
It is an amenable number.
680545169 is a deficient number, since it is larger than the sum of its proper divisors (1).
680545169 is an equidigital number, since it uses as much as digits as its factorization.
680545169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 44.
The square root of 680545169 is about 26087.2606649299. The cubic root of 680545169 is about 879.6008731515.
The spelling of 680545169 in words is "six hundred eighty million, five hundred forty-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •