Base | Representation |
---|---|
bin | 101000101100001… |
… | …010110101011000 |
3 | 1202120120002120000 |
4 | 220230022311120 |
5 | 2344230323402 |
6 | 151423533000 |
7 | 22626401553 |
oct | 5054126530 |
9 | 1676502500 |
10 | 682667352 |
11 | 3203910a4 |
12 | 17075a160 |
13 | ab5810a3 |
14 | 6694569a |
15 | 3edebc1c |
hex | 28b0ad58 |
682667352 has 80 divisors (see below), whose sum is σ = 1929228840. Its totient is φ = 225517824.
The previous prime is 682667341. The next prime is 682667357. The reversal of 682667352 is 253766286.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 682667298 and 682667307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (682667357) 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 19 ways as a sum of consecutive naturals, for example, 68563 + ... + 77885.
Almost surely, 2682667352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 682667352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (964614420).
682667352 is an abundant number, since it is smaller than the sum of its proper divisors (1246561488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
682667352 is a wasteful number, since it uses less digits than its factorization.
682667352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9454 (or 9441 counting only the distinct ones).
The product of its digits is 725760, while the sum is 45.
The square root of 682667352 is about 26127.9037046603. The cubic root of 682667352 is about 880.5142276896.
The spelling of 682667352 in words is "six hundred eighty-two million, six hundred sixty-seven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •