Base | Representation |
---|---|
bin | 10100110100001100000 |
3 | 1021122122020 |
4 | 2212201200 |
5 | 133311310 |
6 | 22341440 |
7 | 5540400 |
oct | 2464140 |
9 | 1248566 |
10 | 682080 |
11 | 426503 |
12 | 28a880 |
13 | 1ab5c9 |
14 | 13a800 |
15 | d7170 |
hex | a6860 |
682080 has 144 divisors (see below), whose sum is σ = 2585520. Its totient is φ = 150528.
The previous prime is 682079. The next prime is 682141. The reversal of 682080 is 80286.
682080 = T15 + T16 + ... + T159.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 682080.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23506 + ... + 23534.
It is an arithmetic number, because the mean of its divisors is an integer number (17955).
2682080 is an apocalyptic number.
682080 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 682080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1292760).
682080 is an abundant number, since it is smaller than the sum of its proper divisors (1903440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
682080 is a wasteful number, since it uses less digits than its factorization.
682080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61 (or 46 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 682080 is about 825.8813474101. The cubic root of 682080 is about 88.0261630197.
The spelling of 682080 in words is "six hundred eighty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •