Base | Representation |
---|---|
bin | 101000100100000… |
… | …001011001110001 |
3 | 1202102112120210221 |
4 | 220210001121301 |
5 | 2343204002234 |
6 | 151310053041 |
7 | 22602265024 |
oct | 5044013161 |
9 | 1672476727 |
10 | 680531569 |
11 | 31a162493 |
12 | 16baaa181 |
13 | aacb3c03 |
14 | 6654b1bb |
15 | 3eb28eb4 |
hex | 28901671 |
680531569 has 9 divisors (see below), whose sum is σ = 718757643. Its totient is φ = 644244552.
The previous prime is 680531549. The next prime is 680531591. The reversal of 680531569 is 965135086.
The square root of 680531569 is 26087.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 672624225 + 7907344 = 25935^2 + 2812^2 .
It is not a de Polignac number, because 680531569 - 29 = 680531057 is a prime.
It is a super-2 number, since 2×6805315692 = 926246432811203522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (680531519) 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 in 8 ways as a sum of consecutive naturals, for example, 494967 + ... + 496339.
Almost surely, 2680531569 is an apocalyptic number.
680531569 is the 26087-th square number.
680531569 is the 13044-th centered octagonal number.
It is an amenable number.
680531569 is a deficient number, since it is larger than the sum of its proper divisors (38226074).
680531569 is an frugal number, since it uses more digits than its factorization.
680531569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2784 (or 1392 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 43.
The cubic root of 680531569 is about 879.5950138042.
The spelling of 680531569 in words is "six hundred eighty million, five hundred thirty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •