Base | Representation |
---|---|
bin | 1101101101101… |
… | …0010000000000 |
3 | 11000020011120100 |
4 | 3123122100000 |
5 | 104211021211 |
6 | 5412442400 |
7 | 1265613132 |
oct | 333322000 |
9 | 130204510 |
10 | 57517056 |
11 | 2a515463 |
12 | 17319400 |
13 | bbbaa7c |
14 | 78d3052 |
15 | 50b2156 |
hex | 36da400 |
57517056 has 99 divisors (see below), whose sum is σ = 168208131. Its totient is φ = 18929664.
The previous prime is 57517039. The next prime is 57517067. The reversal of 57517056 is 65071575.
The square root of 57517056 is 7584.
It is a perfect power (a square), and thus also a powerful number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 8.
It is a zygodrome in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 57517056.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 728025 + ... + 728103.
Almost surely, 257517056 is an apocalyptic number.
57517056 is the 7584-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57517056
57517056 is an abundant number, since it is smaller than the sum of its proper divisors (110691075).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57517056 is an equidigital number, since it uses as much as digits as its factorization.
57517056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 36750, while the sum is 36.
The cubic root of 57517056 is about 386.0102908297.
Multiplying 57517056 by its sum of digits (36), we get a square (2070614016 = 455042).
57517056 divided by its sum of digits (36) gives a square (1597696 = 12642).
The spelling of 57517056 in words is "fifty-seven million, five hundred seventeen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •