Base | Representation |
---|---|
bin | 1101100111011… |
… | …1011111110000 |
3 | 10222110121201000 |
4 | 3121313133300 |
5 | 104110100220 |
6 | 5400042000 |
7 | 1262306631 |
oct | 331673760 |
9 | 128417630 |
10 | 57112560 |
11 | 2a26956a |
12 | 17163300 |
13 | baa891b |
14 | 7829888 |
15 | 5032390 |
hex | 36777f0 |
57112560 has 160 divisors (see below), whose sum is σ = 199183680. Its totient is φ = 15040512.
The previous prime is 57112553. The next prime is 57112589. The reversal of 57112560 is 6521175.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 295824 + ... + 296016.
It is an arithmetic number, because the mean of its divisors is an integer number (1244898).
Almost surely, 257112560 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 57112560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99591840).
57112560 is an abundant number, since it is smaller than the sum of its proper divisors (142071120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57112560 is a wasteful number, since it uses less digits than its factorization.
57112560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352 (or 340 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 57112560 is about 7557.2852268523. The cubic root of 57112560 is about 385.1032724587.
It can be divided in two parts, 571 and 12560, that added together give a palindrome (13131).
The spelling of 57112560 in words is "fifty-seven million, one hundred twelve thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •