Base | Representation |
---|---|
bin | 1101100111001… |
… | …0101000111000 |
3 | 10222102121102010 |
4 | 3121302220320 |
5 | 104103431124 |
6 | 5355405520 |
7 | 1262164626 |
oct | 331625070 |
9 | 128377363 |
10 | 57092664 |
11 | 2a255622 |
12 | 171538a0 |
13 | ba9c855 |
14 | 7822516 |
15 | 502b529 |
hex | 3672a38 |
57092664 has 64 divisors (see below), whose sum is σ = 154859040. Its totient is φ = 17469440.
The previous prime is 57092657. The next prime is 57092671. The reversal of 57092664 is 46629075.
57092664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (57092657) and next prime (57092671).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 15022 + ... + 18434.
Almost surely, 257092664 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 57092664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77429520).
57092664 is an abundant number, since it is smaller than the sum of its proper divisors (97766376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57092664 is a wasteful number, since it uses less digits than its factorization.
57092664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3480 (or 3476 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 57092664 is about 7555.9687664786. The cubic root of 57092664 is about 385.0585484692.
The spelling of 57092664 in words is "fifty-seven million, ninety-two thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •