Base | Representation |
---|---|
bin | 1101101000110… |
… | …1000101011100 |
3 | 10222122010000010 |
4 | 3122031011130 |
5 | 104120412423 |
6 | 5402003220 |
7 | 1263125505 |
oct | 332150534 |
9 | 128563003 |
10 | 57200988 |
11 | 2a319a49 |
12 | 171a6510 |
13 | bb09c50 |
14 | 784dbac |
15 | 504d693 |
hex | 368d15c |
57200988 has 48 divisors (see below), whose sum is σ = 152197920. Its totient is φ = 16564224.
The previous prime is 57200959. The next prime is 57200989. The reversal of 57200988 is 88900275.
57200988 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×572009882 = 6543906056352288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57200989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8133 + ... + 13436.
It is an arithmetic number, because the mean of its divisors is an integer number (3170790).
Almost surely, 257200988 is an apocalyptic number.
It is an amenable number.
57200988 is an abundant number, since it is smaller than the sum of its proper divisors (94996932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57200988 is a wasteful number, since it uses less digits than its factorization.
57200988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21606 (or 21604 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 39.
The square root of 57200988 is about 7563.1334776004. The cubic root of 57200988 is about 385.3019231696.
The spelling of 57200988 in words is "fifty-seven million, two hundred thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •