Base | Representation |
---|---|
bin | 101000100100110… |
… | …010001111010101 |
3 | 1202102220202012200 |
4 | 220210302033111 |
5 | 2343231402410 |
6 | 151314235113 |
7 | 22604060151 |
oct | 5044621725 |
9 | 1672822180 |
10 | 680731605 |
11 | 31a289804 |
12 | 16bb85a99 |
13 | ab053c88 |
14 | 665a0061 |
15 | 3eb683c0 |
hex | 289323d5 |
680731605 has 12 divisors (see below), whose sum is σ = 1179934860. Its totient is φ = 363056832.
The previous prime is 680731603. The next prime is 680731607. The reversal of 680731605 is 506137086.
It is an interprime number because it is at equal distance from previous prime (680731603) and next prime (680731607).
It can be written as a sum of positive squares in 2 ways, for example, as 301300164 + 379431441 = 17358^2 + 19479^2 .
It is not a de Polignac number, because 680731605 - 21 = 680731603 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 680731605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (680731603) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7563640 + ... + 7563729.
It is an arithmetic number, because the mean of its divisors is an integer number (98327905).
Almost surely, 2680731605 is an apocalyptic number.
It is an amenable number.
680731605 is a deficient number, since it is larger than the sum of its proper divisors (499203255).
680731605 is a wasteful number, since it uses less digits than its factorization.
680731605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15127380 (or 15127377 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 680731605 is about 26090.8337352412. The cubic root of 680731605 is about 879.6811883180.
The spelling of 680731605 in words is "six hundred eighty million, seven hundred thirty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •