Base | Representation |
---|---|
bin | 1101110001011… |
… | …1110000000000 |
3 | 11000200222010010 |
4 | 3130113300000 |
5 | 104242101320 |
6 | 5422104520 |
7 | 1301012424 |
oct | 334276000 |
9 | 130628103 |
10 | 57768960 |
11 | 2a677747 |
12 | 1741b140 |
13 | bc78622 |
14 | 795ab84 |
15 | 5111ae0 |
hex | 3717c00 |
57768960 has 88 divisors (see below), whose sum is σ = 184819536. Its totient is φ = 15400960.
The previous prime is 57768947. The next prime is 57768961. The reversal of 57768960 is 6986775.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57768961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13480 + ... + 17240.
It is an arithmetic number, because the mean of its divisors is an integer number (2100222).
Almost surely, 257768960 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 57768960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92409768).
57768960 is an abundant number, since it is smaller than the sum of its proper divisors (127050576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57768960 is a wasteful number, since it uses less digits than its factorization.
57768960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3789 (or 3771 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 48.
The square root of 57768960 is about 7600.5894508255. The cubic root of 57768960 is about 386.5729988465.
The spelling of 57768960 in words is "fifty-seven million, seven hundred sixty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •