Base | Representation |
---|---|
bin | 11101001111101… |
… | …110001001011001 |
3 | 1021012021010120221 |
4 | 131033232021121 |
5 | 2001102113231 |
6 | 120404320041 |
7 | 15105354625 |
oct | 3517561131 |
9 | 1235233527 |
10 | 490660441 |
11 | 231a684a7 |
12 | 1183a3021 |
13 | 7a86502b |
14 | 49244185 |
15 | 2d120d11 |
hex | 1d3ee259 |
490660441 has 8 divisors (see below), whose sum is σ = 504358344. Its totient is φ = 476985600.
The previous prime is 490660421. The next prime is 490660447. The reversal of 490660441 is 144066094.
It can be written as a sum of positive squares in 4 ways, for example, as 60512841 + 430147600 = 7779^2 + 20740^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 490660441 - 29 = 490659929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 490660397 and 490660406.
It is not an unprimeable number, because it can be changed into a prime (490660447) 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, 43041 + ... + 53233.
It is an arithmetic number, because the mean of its divisors is an integer number (63044793).
Almost surely, 2490660441 is an apocalyptic number.
It is an amenable number.
490660441 is a deficient number, since it is larger than the sum of its proper divisors (13697903).
490660441 is a wasteful number, since it uses less digits than its factorization.
490660441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11531.
The product of its (nonzero) digits is 20736, while the sum is 34.
The square root of 490660441 is about 22150.8564394246. The cubic root of 490660441 is about 788.7275574263.
The spelling of 490660441 in words is "four hundred ninety million, six hundred sixty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •