Base | Representation |
---|---|
bin | 11101001100110… |
… | …110001011010100 |
3 | 1021010211211221000 |
4 | 131030312023110 |
5 | 2000404010100 |
6 | 120340223300 |
7 | 15066066000 |
oct | 3514661324 |
9 | 1233754830 |
10 | 489906900 |
11 | 2315a333a |
12 | 11809ab30 |
13 | 7a660052 |
14 | 490c9700 |
15 | 2d022900 |
hex | 1d3362d4 |
489906900 has 432 divisors, whose sum is σ = 1920016000. Its totient is φ = 107110080.
The previous prime is 489906871. The next prime is 489906917. The reversal of 489906900 is 9609984.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is a super-2 number, since 2×4899069002 = 480017541335220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 21300289 + ... + 21300311.
Almost surely, 2489906900 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 489906900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (960008000).
489906900 is an abundant number, since it is smaller than the sum of its proper divisors (1430109100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489906900 is a wasteful number, since it uses less digits than its factorization.
489906900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90 (or 40 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 45.
The square root of 489906900 is about 22133.8406066367. The cubic root of 489906900 is about 788.3235828252.
The spelling of 489906900 in words is "four hundred eighty-nine million, nine hundred six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •