Base | Representation |
---|---|
bin | 11101001011000… |
… | …110100001101000 |
3 | 1021002222121121002 |
4 | 131023012201220 |
5 | 2000244341301 |
6 | 120322334132 |
7 | 15062152460 |
oct | 3513064150 |
9 | 1232877532 |
10 | 489449576 |
11 | 231310790 |
12 | 117aba348 |
13 | 7a52cb45 |
14 | 4900aba0 |
15 | 2ce8216b |
hex | 1d2c6868 |
489449576 has 192 divisors, whose sum is σ = 1264066560. Its totient is φ = 172368000.
The previous prime is 489449573. The next prime is 489449581. The reversal of 489449576 is 675944984.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is not an unprimeable number, because it can be changed into a prime (489449573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6893621 + ... + 6893691.
It is an arithmetic number, because the mean of its divisors is an integer number (6583680).
Almost surely, 2489449576 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 489449576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (632033280).
489449576 is an abundant number, since it is smaller than the sum of its proper divisors (774616984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489449576 is a wasteful number, since it uses less digits than its factorization.
489449576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164 (or 141 counting only the distinct ones).
The product of its digits is 8709120, while the sum is 56.
The square root of 489449576 is about 22123.5073168790. The cubic root of 489449576 is about 788.0782086307.
The spelling of 489449576 in words is "four hundred eighty-nine million, four hundred forty-nine thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •