Base | Representation |
---|---|
bin | 1100100110100… |
… | …0101000111000 |
3 | 10200110102201111 |
4 | 3021220220320 |
5 | 102012414100 |
6 | 5124530104 |
7 | 1211165131 |
oct | 311505070 |
9 | 120412644 |
10 | 52857400 |
11 | 27922602 |
12 | 15850934 |
13 | ac48b8b |
14 | 703cc88 |
15 | 49916ba |
hex | 3268a38 |
52857400 has 48 divisors (see below), whose sum is σ = 123920640. Its totient is φ = 20966400.
The previous prime is 52857383. The next prime is 52857407. The reversal of 52857400 is 475825.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52857407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24360 + ... + 26440.
It is an arithmetic number, because the mean of its divisors is an integer number (2581680).
Almost surely, 252857400 is an apocalyptic number.
52857400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52857400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61960320).
52857400 is an abundant number, since it is smaller than the sum of its proper divisors (71063240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52857400 is a wasteful number, since it uses less digits than its factorization.
52857400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2224 (or 2215 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 31.
The square root of 52857400 is about 7270.3094844718. The cubic root of 52857400 is about 375.2913883371.
The spelling of 52857400 in words is "fifty-two million, eight hundred fifty-seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •