Base | Representation |
---|---|
bin | 1101101001100… |
… | …0111100100010 |
3 | 10222201120122110 |
4 | 3122120330202 |
5 | 104123441240 |
6 | 5403020150 |
7 | 1263420240 |
oct | 332307442 |
9 | 128646573 |
10 | 57249570 |
11 | 2a3524a4 |
12 | 1720a656 |
13 | bb260b1 |
14 | 7863790 |
15 | 505cc80 |
hex | 3698f22 |
57249570 has 64 divisors (see below), whose sum is σ = 158008320. Its totient is φ = 13003968.
The previous prime is 57249559. The next prime is 57249583. The reversal of 57249570 is 7594275.
57249570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 36829 + ... + 38351.
It is an arithmetic number, because the mean of its divisors is an integer number (2468880).
Almost surely, 257249570 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57249570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79004160).
57249570 is an abundant number, since it is smaller than the sum of its proper divisors (100758750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57249570 is a wasteful number, since it uses less digits than its factorization.
57249570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1719.
The product of its (nonzero) digits is 88200, while the sum is 39.
The square root of 57249570 is about 7566.3445599576. The cubic root of 57249570 is about 385.4109739732.
The spelling of 57249570 in words is "fifty-seven million, two hundred forty-nine thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •