Base | Representation |
---|---|
bin | 11101001101110… |
… | …011010011010110 |
3 | 1021011022120100222 |
4 | 131031303103112 |
5 | 2000440013040 |
6 | 120345434342 |
7 | 15101160641 |
oct | 3515632326 |
9 | 1234276328 |
10 | 490157270 |
11 | 231754459 |
12 | 11819b9b2 |
13 | 7a719cb5 |
14 | 49152a58 |
15 | 2d071bb5 |
hex | 1d3734d6 |
490157270 has 16 divisors (see below), whose sum is σ = 882660240. Its totient is φ = 195979104.
The previous prime is 490157251. The next prime is 490157273. The reversal of 490157270 is 72751094.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 490157270.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490157273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17696 + ... + 35964.
It is an arithmetic number, because the mean of its divisors is an integer number (55166265).
Almost surely, 2490157270 is an apocalyptic number.
490157270 is a deficient number, since it is larger than the sum of its proper divisors (392502970).
490157270 is a wasteful number, since it uses less digits than its factorization.
490157270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20959.
The product of its (nonzero) digits is 17640, while the sum is 35.
The square root of 490157270 is about 22139.4957033804. The cubic root of 490157270 is about 788.4578525284.
The spelling of 490157270 in words is "four hundred ninety million, one hundred fifty-seven thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •