Base | Representation |
---|---|
bin | 1101110100010… |
… | …0011111001000 |
3 | 11001001021110210 |
4 | 3131010133020 |
5 | 104313432300 |
6 | 5430041120 |
7 | 1302404565 |
oct | 335043710 |
9 | 131037423 |
10 | 57952200 |
11 | 2a792389 |
12 | 174a91a0 |
13 | c010b57 |
14 | 79a786c |
15 | 514b050 |
hex | 37447c8 |
57952200 has 48 divisors (see below), whose sum is σ = 179653680. Its totient is φ = 15453760.
The previous prime is 57952189. The next prime is 57952207. The reversal of 57952200 is 225975.
It is a happy number.
57952200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (57952207) 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 11 ways as a sum of consecutive naturals, for example, 47694 + ... + 48893.
It is an arithmetic number, because the mean of its divisors is an integer number (3742785).
Almost surely, 257952200 is an apocalyptic number.
57952200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
57952200 is an abundant number, since it is smaller than the sum of its proper divisors (121701480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57952200 is a wasteful number, since it uses less digits than its factorization.
57952200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96606 (or 96597 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 57952200 is about 7612.6342352697. The cubic root of 57952200 is about 386.9812969615.
The spelling of 57952200 in words is "fifty-seven million, nine hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •