Base | Representation |
---|---|
bin | 11100111100000… |
… | …000000011000000 |
3 | 1020211112111021201 |
4 | 130330000003000 |
5 | 1443241202010 |
6 | 120101430544 |
7 | 15013414210 |
oct | 3474000300 |
9 | 1224474251 |
10 | 485490880 |
11 | 22a057536 |
12 | 11670b454 |
13 | 79775014 |
14 | 4869a240 |
15 | 2c94e23a |
hex | 1cf000c0 |
485490880 has 112 divisors (see below), whose sum is σ = 1339778880. Its totient is φ = 164118528.
The previous prime is 485490853. The next prime is 485490893. The reversal of 485490880 is 88094584.
It is a tau number, because it is divible by the number of its divisors (112).
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 485490880.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162036 + ... + 165004.
Almost surely, 2485490880 is an apocalyptic number.
485490880 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 485490880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (669889440).
485490880 is an abundant number, since it is smaller than the sum of its proper divisors (854288000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485490880 is a wasteful number, since it uses less digits than its factorization.
485490880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3066 (or 3056 counting only the distinct ones).
The product of its (nonzero) digits is 368640, while the sum is 46.
The square root of 485490880 is about 22033.8575832740. The cubic root of 485490880 is about 785.9477808048.
The spelling of 485490880 in words is "four hundred eighty-five million, four hundred ninety thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •