Base | Representation |
---|---|
bin | 1110110011110010100 |
3 | 220122122220 |
4 | 1312132110 |
5 | 111012033 |
6 | 14222340 |
7 | 4060530 |
oct | 1663624 |
9 | 818586 |
10 | 485268 |
11 | 301653 |
12 | 1b49b0 |
13 | 13cb54 |
14 | c8bc0 |
15 | 98bb3 |
hex | 76794 |
485268 has 48 divisors (see below), whose sum is σ = 1330560. Its totient is φ = 134784.
The previous prime is 485263. The next prime is 485311. The reversal of 485268 is 862584.
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 485268.
It is not an unprimeable number, because it can be changed into a prime (485263) by changing a digit.
485268 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4398 + ... + 4506.
It is an arithmetic number, because the mean of its divisors is an integer number (27720).
2485268 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 485268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (665280).
485268 is an abundant number, since it is smaller than the sum of its proper divisors (845292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485268 is a wasteful number, since it uses less digits than its factorization.
485268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176 (or 174 counting only the distinct ones).
The product of its digits is 15360, while the sum is 33.
The square root of 485268 is about 696.6118000723. The cubic root of 485268 is about 78.5827490969.
The spelling of 485268 in words is "four hundred eighty-five thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •