Base | Representation |
---|---|
bin | 1101101011001… |
… | …0100111111110 |
3 | 10222220220221000 |
4 | 3122302213332 |
5 | 104140323000 |
6 | 5405151130 |
7 | 1264336005 |
oct | 332624776 |
9 | 128826830 |
10 | 57354750 |
11 | 2a414522 |
12 | 1725b4a6 |
13 | bb61c2b |
14 | 788dc3c |
15 | 507e000 |
hex | 36b29fe |
57354750 has 128 divisors (see below), whose sum is σ = 165110400. Its totient is φ = 14716800.
The previous prime is 57354727. The next prime is 57354751. The reversal of 57354750 is 5745375.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57354751) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 195604 + ... + 195896.
It is an arithmetic number, because the mean of its divisors is an integer number (1289925).
Almost surely, 257354750 is an apocalyptic number.
57354750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 57354750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82555200).
57354750 is an abundant number, since it is smaller than the sum of its proper divisors (107755650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57354750 is a wasteful number, since it uses less digits than its factorization.
57354750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348 (or 332 counting only the distinct ones).
The product of its (nonzero) digits is 73500, while the sum is 36.
The square root of 57354750 is about 7573.2918866237. The cubic root of 57354750 is about 385.6468577019.
The spelling of 57354750 in words is "fifty-seven million, three hundred fifty-four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •