Base | Representation |
---|---|
bin | 1110001110010100000 |
3 | 212200100020 |
4 | 1301302200 |
5 | 104403310 |
6 | 13553440 |
7 | 3650556 |
oct | 1616240 |
9 | 780306 |
10 | 466080 |
11 | 29919a |
12 | 1a5880 |
13 | 1341b4 |
14 | c1bd6 |
15 | 93170 |
hex | 71ca0 |
466080 has 48 divisors (see below), whose sum is σ = 1469664. Its totient is φ = 124160.
The previous prime is 466079. The next prime is 466087. The reversal of 466080 is 80664.
It is a tau number, because it is divible by the number of its divisors (48).
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 466080.
It is not an unprimeable number, because it can be changed into a prime (466087) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6 + ... + 965.
It is an arithmetic number, because the mean of its divisors is an integer number (30618).
2466080 is an apocalyptic number.
466080 is a gapful number since it is divisible by the number (40) 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 466080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (734832).
466080 is an abundant number, since it is smaller than the sum of its proper divisors (1003584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466080 is a wasteful number, since it uses less digits than its factorization.
466080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 989 (or 981 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 466080 is about 682.7005199939. The cubic root of 466080 is about 77.5330417554.
The spelling of 466080 in words is "four hundred sixty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •