Base | Representation |
---|---|
bin | 100010100100101… |
… | …101000011100000 |
3 | 1111102110102222220 |
4 | 202210231003200 |
5 | 2141443001242 |
6 | 133320231040 |
7 | 20242214223 |
oct | 4244550340 |
9 | 1442412886 |
10 | 580047072 |
11 | 27846aa50 |
12 | 14230b480 |
13 | 93230a27 |
14 | 570715ba |
15 | 35dcabec |
hex | 2292d0e0 |
580047072 has 192 divisors, whose sum is σ = 1785369600. Its totient is φ = 162938880.
The previous prime is 580047071. The next prime is 580047133. The reversal of 580047072 is 270740085.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (580047071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1418004 + ... + 1418412.
It is an arithmetic number, because the mean of its divisors is an integer number (9298800).
Almost surely, 2580047072 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 580047072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (892684800).
580047072 is an abundant number, since it is smaller than the sum of its proper divisors (1205322528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
580047072 is a wasteful number, since it uses less digits than its factorization.
580047072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529 (or 521 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 33.
The square root of 580047072 is about 24084.1664169637. The cubic root of 580047072 is about 833.9776518116.
The spelling of 580047072 in words is "five hundred eighty million, forty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •