Base | Representation |
---|---|
bin | 11101010000101… |
… | …011000110100000 |
3 | 1021012201211002000 |
4 | 131100223012200 |
5 | 2001133110422 |
6 | 120413524000 |
7 | 15110444550 |
oct | 3520530640 |
9 | 1235654060 |
10 | 490910112 |
11 | 232119040 |
12 | 1184a3600 |
13 | 7a921874 |
14 | 492ab160 |
15 | 2d16ecac |
hex | 1d42b1a0 |
490910112 has 384 divisors, whose sum is σ = 1834721280. Its totient is φ = 124001280.
The previous prime is 490910111. The next prime is 490910129. The reversal of 490910112 is 211019094.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (490910111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3126738 + ... + 3126894.
It is an arithmetic number, because the mean of its divisors is an integer number (4777920).
Almost surely, 2490910112 is an apocalyptic number.
490910112 is a gapful number since it is divisible by the number (42) 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 490910112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (917360640).
490910112 is an abundant number, since it is smaller than the sum of its proper divisors (1343811168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490910112 is a wasteful number, since it uses less digits than its factorization.
490910112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241 (or 227 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The square root of 490910112 is about 22156.4914189950. The cubic root of 490910112 is about 788.8613152419.
The spelling of 490910112 in words is "four hundred ninety million, nine hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •