Base | Representation |
---|---|
bin | 1101100111011… |
… | …1011110000100 |
3 | 10222110121120000 |
4 | 3121313132010 |
5 | 104110044302 |
6 | 5400041300 |
7 | 1262306415 |
oct | 331673604 |
9 | 128417500 |
10 | 57112452 |
11 | 2a269481 |
12 | 17163230 |
13 | baa8867 |
14 | 782980c |
15 | 503231c |
hex | 3677784 |
57112452 has 60 divisors (see below), whose sum is σ = 158101020. Its totient is φ = 17915904.
The previous prime is 57112417. The next prime is 57112453. The reversal of 57112452 is 25421175.
It can be written as a sum of positive squares in 2 ways, for example, as 21399876 + 35712576 = 4626^2 + 5976^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57112453) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 324 + ... + 10692.
It is an arithmetic number, because the mean of its divisors is an integer number (2635017).
Almost surely, 257112452 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 57112452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79050510).
57112452 is an abundant number, since it is smaller than the sum of its proper divisors (100988568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57112452 is a wasteful number, since it uses less digits than its factorization.
57112452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10402 (or 10391 counting only the distinct ones).
The product of its digits is 2800, while the sum is 27.
The square root of 57112452 is about 7557.2780814259. The cubic root of 57112452 is about 385.1030297148.
The spelling of 57112452 in words is "fifty-seven million, one hundred twelve thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •