Base | Representation |
---|---|
bin | 11101001111001… |
… | …010101010110101 |
3 | 1021011222202020212 |
4 | 131033022222311 |
5 | 2001032441000 |
6 | 120401235205 |
7 | 15104211152 |
oct | 3517125265 |
9 | 1234882225 |
10 | 490515125 |
11 | 231979301 |
12 | 118332b05 |
13 | 7a813b49 |
14 | 49207229 |
15 | 2d0e2c35 |
hex | 1d3caab5 |
490515125 has 8 divisors (see below), whose sum is σ = 612163032. Its totient is φ = 392412000.
The previous prime is 490515121. The next prime is 490515163. The reversal of 490515125 is 521515094.
It can be written as a sum of positive squares in 4 ways, for example, as 10817521 + 479697604 = 3289^2 + 21902^2 .
It is not a de Polignac number, because 490515125 - 22 = 490515121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 490515091 and 490515100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490515121) 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, 1961936 + ... + 1962185.
It is an arithmetic number, because the mean of its divisors is an integer number (76520379).
Almost surely, 2490515125 is an apocalyptic number.
It is an amenable number.
490515125 is a deficient number, since it is larger than the sum of its proper divisors (121647907).
490515125 is an equidigital number, since it uses as much as digits as its factorization.
490515125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3924136 (or 3924126 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 32.
The square root of 490515125 is about 22147.5760524713. The cubic root of 490515125 is about 788.6496854800.
The spelling of 490515125 in words is "four hundred ninety million, five hundred fifteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •