Base | Representation |
---|---|
bin | 11101001111000… |
… | …111110110110001 |
3 | 1021011222011110001 |
4 | 131033013312301 |
5 | 2001032103401 |
6 | 120401110001 |
7 | 15104132440 |
oct | 3517076661 |
9 | 1234864401 |
10 | 490503601 |
11 | 231970685 |
12 | 118328301 |
13 | 7a80b823 |
14 | 49202d57 |
15 | 2d0de601 |
hex | 1d3c7db1 |
490503601 has 32 divisors (see below), whose sum is σ = 627505920. Its totient is φ = 373248000.
The previous prime is 490503581. The next prime is 490503619. The reversal of 490503601 is 106305094.
It is a 3-Lehmer number, since φ(490503601) divides (490503601-1)3.
It is a cyclic number.
It is a Carmichael number.
It is not a de Polignac number, because 490503601 - 25 = 490503569 is a prime.
It is a deceptive number, since it divides R490503600.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 490503601.
It is not an unprimeable number, because it can be changed into a prime (490503641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 906391 + ... + 906931.
It is an arithmetic number, because the mean of its divisors is an integer number (19609560).
It is a Poulet number, since it divides 2490503600-1.
Almost surely, 2490503601 is an apocalyptic number.
It is an amenable number.
490503601 is a deficient number, since it is larger than the sum of its proper divisors (137002319).
490503601 is a wasteful number, since it uses less digits than its factorization.
490503601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 985.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 490503601 is about 22147.3158870325. The cubic root of 490503601 is about 788.6435093401.
Adding to 490503601 its reverse (106305094), we get a palindrome (596808695).
The spelling of 490503601 in words is "four hundred ninety million, five hundred three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •