Base | Representation |
---|---|
bin | 101011011011000… |
… | …110101010010100 |
3 | 1212202211221001110 |
4 | 223123012222110 |
5 | 2443000303320 |
6 | 200142455020 |
7 | 24024235635 |
oct | 5333065224 |
9 | 1782757043 |
10 | 728525460 |
11 | 344262a63 |
12 | 183b94470 |
13 | b7c19170 |
14 | 6ca8188c |
15 | 43e595e0 |
hex | 2b6c6a94 |
728525460 has 96 divisors (see below), whose sum is σ = 2292353280. Its totient is φ = 171528192.
The previous prime is 728525411. The next prime is 728525477. The reversal of 728525460 is 64525827.
728525460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2365 + ... + 38244.
It is an arithmetic number, because the mean of its divisors is an integer number (23878680).
Almost surely, 2728525460 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 728525460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1146176640).
728525460 is an abundant number, since it is smaller than the sum of its proper divisors (1563827820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
728525460 is a wasteful number, since it uses less digits than its factorization.
728525460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40657 (or 40655 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 39.
The square root of 728525460 is about 26991.2107916633. The cubic root of 728525460 is about 899.8046736609.
The spelling of 728525460 in words is "seven hundred twenty-eight million, five hundred twenty-five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •