Base | Representation |
---|---|
bin | 1101101010011… |
… | …0011010011000 |
3 | 10222211101022100 |
4 | 3122212122120 |
5 | 104132222403 |
6 | 5404123400 |
7 | 1264040115 |
oct | 332463230 |
9 | 128741270 |
10 | 57304728 |
11 | 2a38a988 |
12 | 17236560 |
13 | bb45230 |
14 | 787990c |
15 | 506e2a3 |
hex | 36a6698 |
57304728 has 48 divisors (see below), whose sum is σ = 167141520. Its totient is φ = 17631936.
The previous prime is 57304727. The next prime is 57304733. The reversal of 57304728 is 82740375.
57304728 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 (36).
It is a junction number, because it is equal to n+sod(n) for n = 57304692 and 57304701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57304727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29676 + ... + 31547.
It is an arithmetic number, because the mean of its divisors is an integer number (3482115).
Almost surely, 257304728 is an apocalyptic number.
It is an amenable number.
57304728 is an abundant number, since it is smaller than the sum of its proper divisors (109836792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57304728 is a wasteful number, since it uses less digits than its factorization.
57304728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61248 (or 61241 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The square root of 57304728 is about 7569.9886393574. The cubic root of 57304728 is about 385.5347110009.
The spelling of 57304728 in words is "fifty-seven million, three hundred four thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •