Base | Representation |
---|---|
bin | 1110001101011110000 |
3 | 212122202020 |
4 | 1301223300 |
5 | 104400043 |
6 | 13551440 |
7 | 3646401 |
oct | 1615360 |
9 | 778666 |
10 | 465648 |
11 | 298937 |
12 | 1a5580 |
13 | 133c41 |
14 | c19a8 |
15 | 92e83 |
hex | 71af0 |
465648 has 40 divisors (see below), whose sum is σ = 1227600. Its totient is φ = 152064.
The previous prime is 465643. The next prime is 465649. The reversal of 465648 is 846564.
It is a happy number.
It is a super-3 number, since 3×4656483 = 302896657314533376, which contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (465643) by changing a digit.
465648 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4218 + ... + 4326.
It is an arithmetic number, because the mean of its divisors is an integer number (30690).
2465648 is an apocalyptic number.
465648 is a gapful number since it is divisible by the number (48) 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 465648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (613800).
465648 is an abundant number, since it is smaller than the sum of its proper divisors (761952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465648 is a wasteful number, since it uses less digits than its factorization.
465648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209 (or 203 counting only the distinct ones).
The product of its digits is 23040, while the sum is 33.
The square root of 465648 is about 682.3840560857. The cubic root of 465648 is about 77.5090797548.
The spelling of 465648 in words is "four hundred sixty-five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •