Base | Representation |
---|---|
bin | 1101100101110… |
… | …0010000000000 |
3 | 10222020221121200 |
4 | 3121130100000 |
5 | 104043012320 |
6 | 5353421200 |
7 | 1261333362 |
oct | 331342000 |
9 | 128227550 |
10 | 57000960 |
11 | 2a1a2735 |
12 | 1710a800 |
13 | ba69ba3 |
14 | 77dad32 |
15 | 500e290 |
hex | 365c400 |
57000960 has 132 divisors (see below), whose sum is σ = 197666508. Its totient is φ = 15187968.
The previous prime is 57000959. The next prime is 57000961. The reversal of 57000960 is 6900075.
57000960 is a `hidden beast` number, since 570 + 0 + 0 + 96 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (57000959) and next prime (57000961).
It can be written as a sum of positive squares in 2 ways, for example, as 32080896 + 24920064 = 5664^2 + 4992^2 .
It is not an unprimeable number, because it can be changed into a prime (57000961) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45462 + ... + 46698.
Almost surely, 257000960 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 57000960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98833254).
57000960 is an abundant number, since it is smaller than the sum of its proper divisors (140665548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57000960 is a wasteful number, since it uses less digits than its factorization.
57000960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268 (or 1247 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 57000960 is about 7549.8980125562. The cubic root of 57000960 is about 384.8522736776.
The spelling of 57000960 in words is "fifty-seven million, nine hundred sixty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •