Base | Representation |
---|---|
bin | 11101001111011… |
… | …000110111001100 |
3 | 1021012002201000000 |
4 | 131033120313030 |
5 | 2001041321020 |
6 | 120402404300 |
7 | 15104542512 |
oct | 3517306714 |
9 | 1235081000 |
10 | 490573260 |
11 | 231a08a51 |
12 | 118360690 |
13 | 7a834448 |
14 | 492204b2 |
15 | 2d105090 |
hex | 1d3d8dcc |
490573260 has 84 divisors (see below), whose sum is σ = 1544645088. Its totient is φ = 130815648.
The previous prime is 490573253. The next prime is 490573271. The reversal of 490573260 is 62375094.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 27 ways as a sum of consecutive naturals, for example, 2244 + ... + 31403.
It is an arithmetic number, because the mean of its divisors is an integer number (18388632).
Almost surely, 2490573260 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 490573260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (772322544).
490573260 is an abundant number, since it is smaller than the sum of its proper divisors (1054071828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490573260 is a wasteful number, since it uses less digits than its factorization.
490573260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33674 (or 33657 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The square root of 490573260 is about 22148.8884596948. Note that the first 3 decimals coincide. The cubic root of 490573260 is about 788.6808407125.
The spelling of 490573260 in words is "four hundred ninety million, five hundred seventy-three thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •