Base | Representation |
---|---|
bin | 11101010000110… |
… | …100000110111000 |
3 | 1021012210200200020 |
4 | 131100310012320 |
5 | 2001140301000 |
6 | 120414410440 |
7 | 15110660235 |
oct | 3520640670 |
9 | 1235720606 |
10 | 490947000 |
11 | 232143825 |
12 | 118500a20 |
13 | 7a9355ab |
14 | 492ba78c |
15 | 2d17aba0 |
hex | 1d4341b8 |
490947000 has 128 divisors (see below), whose sum is σ = 1581465600. Its totient is φ = 126672000.
The previous prime is 490946957. The next prime is 490947011. The reversal of 490947000 is 749094.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 90361 + ... + 95639.
It is an arithmetic number, because the mean of its divisors is an integer number (12355200).
Almost surely, 2490947000 is an apocalyptic number.
490947000 is a gapful number since it is divisible by the number (40) 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 490947000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (790732800).
490947000 is an abundant number, since it is smaller than the sum of its proper divisors (1090518600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490947000 is a wasteful number, since it uses less digits than its factorization.
490947000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5334 (or 5320 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 490947000 is about 22157.3238456272. The cubic root of 490947000 is about 788.8810736366.
The spelling of 490947000 in words is "four hundred ninety million, nine hundred forty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •