Base | Representation |
---|---|
bin | 1101101010100… |
… | …1011011001000 |
3 | 10222212000020020 |
4 | 3122221123020 |
5 | 104133121224 |
6 | 5404300440 |
7 | 1264121100 |
oct | 332513310 |
9 | 128760206 |
10 | 57317064 |
11 | 2a399182 |
12 | 17241720 |
13 | bb4aa2c |
14 | 7880200 |
15 | 5072c79 |
hex | 36a96c8 |
57317064 has 192 divisors, whose sum is σ = 183202560. Its totient is φ = 14837760.
The previous prime is 57317063. The next prime is 57317069. The reversal of 57317064 is 46071375.
57317064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (57317063) 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 47 ways as a sum of consecutive naturals, for example, 939594 + ... + 939654.
It is an arithmetic number, because the mean of its divisors is an integer number (954180).
Almost surely, 257317064 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 57317064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91601280).
57317064 is an abundant number, since it is smaller than the sum of its proper divisors (125885496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57317064 is a wasteful number, since it uses less digits than its factorization.
57317064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 57317064 is about 7570.8033919790. The cubic root of 57317064 is about 385.5623737268.
The spelling of 57317064 in words is "fifty-seven million, three hundred seventeen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •