Base | Representation |
---|---|
bin | 11101001111100… |
… | …001001111010000 |
3 | 1021012011110001200 |
4 | 131033201033100 |
5 | 2001043420233 |
6 | 120403231200 |
7 | 15105044523 |
oct | 3517411720 |
9 | 1235143050 |
10 | 490607568 |
11 | 231a31800 |
12 | 118378500 |
13 | 7a846c49 |
14 | 4922cbba |
15 | 2d110313 |
hex | 1d3e13d0 |
490607568 has 180 divisors, whose sum is σ = 1552012644. Its totient is φ = 144460800.
The previous prime is 490607563. The next prime is 490607627. The reversal of 490607568 is 865706094.
It can be written as a sum of positive squares in 2 ways, for example, as 177742224 + 312865344 = 13332^2 + 17688^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490607561) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 644308 + ... + 645068.
Almost surely, 2490607568 is an apocalyptic number.
490607568 is a gapful number since it is divisible by the number (48) 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 490607568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (776006322).
490607568 is an abundant number, since it is smaller than the sum of its proper divisors (1061405076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490607568 is a wasteful number, since it uses less digits than its factorization.
490607568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834 (or 814 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 490607568 is about 22149.6629319726. The cubic root of 490607568 is about 788.6992256197.
The spelling of 490607568 in words is "four hundred ninety million, six hundred seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •