Base | Representation |
---|---|
bin | 101000110110010… |
… | …100001011010100 |
3 | 1202202120012222201 |
4 | 220312110023110 |
5 | 2400420431220 |
6 | 152000534244 |
7 | 22661120035 |
oct | 5066241324 |
9 | 1682505881 |
10 | 685327060 |
11 | 321938400 |
12 | 171621384 |
13 | abca2892 |
14 | 67038a8c |
15 | 40274d0a |
hex | 28d942d4 |
685327060 has 36 divisors (see below), whose sum is σ = 1581921684. Its totient is φ = 249208960.
The previous prime is 685327057. The next prime is 685327063. The reversal of 685327060 is 60723586.
It is an interprime number because it is at equal distance from previous prime (685327057) and next prime (685327063).
It can be written as a sum of positive squares in 2 ways, for example, as 534626884 + 150700176 = 23122^2 + 12276^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (685327063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 139177 + ... + 144016.
It is an arithmetic number, because the mean of its divisors is an integer number (43942269).
Almost surely, 2685327060 is an apocalyptic number.
It is an amenable number.
685327060 is an abundant number, since it is smaller than the sum of its proper divisors (896594624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
685327060 is a wasteful number, since it uses less digits than its factorization.
685327060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283224 (or 283211 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
The square root of 685327060 is about 26178.7520710977. The cubic root of 685327060 is about 881.6562557906.
The spelling of 685327060 in words is "six hundred eighty-five million, three hundred twenty-seven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •