Base | Representation |
---|---|
bin | 1110001111101000000 |
3 | 212201021010 |
4 | 1301331000 |
5 | 104414002 |
6 | 14000520 |
7 | 3652536 |
oct | 1617500 |
9 | 781233 |
10 | 466752 |
11 | 299750 |
12 | 1a6140 |
13 | 1345b0 |
14 | c2156 |
15 | 9346c |
hex | 71f40 |
466752 has 112 divisors (see below), whose sum is σ = 1536192. Its totient is φ = 122880.
The previous prime is 466751. The next prime is 466777. The reversal of 466752 is 257664.
466752 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Its product of digits (10080) is a multiple of the sum of its prime factors (56).
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 466752.
It is not an unprimeable number, because it can be changed into a prime (466751) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27448 + ... + 27464.
It is an arithmetic number, because the mean of its divisors is an integer number (13716).
2466752 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 466752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (768096).
466752 is an abundant number, since it is smaller than the sum of its proper divisors (1069440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466752 is a wasteful number, since it uses less digits than its factorization.
466752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56 (or 46 counting only the distinct ones).
The product of its digits is 10080, while the sum is 30.
The square root of 466752 is about 683.1925058137. The cubic root of 466752 is about 77.5702865657.
The spelling of 466752 in words is "four hundred sixty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •