Base | Representation |
---|---|
bin | 1100011011100… |
… | …0110000101000 |
3 | 10122002211112000 |
4 | 3012320300220 |
5 | 101321341000 |
6 | 5101251000 |
7 | 1202104626 |
oct | 306706050 |
9 | 118084460 |
10 | 52137000 |
11 | 27480333 |
12 | 15563a60 |
13 | aa55cc6 |
14 | 6cd2516 |
15 | 489d000 |
hex | 31b8c28 |
52137000 has 128 divisors (see below), whose sum is σ = 180835200. Its totient is φ = 13896000.
The previous prime is 52136963. The next prime is 52137013. The reversal of 52137000 is 73125.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 26035 + ... + 27965.
It is an arithmetic number, because the mean of its divisors is an integer number (1412775).
Almost surely, 252137000 is an apocalyptic number.
52137000 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 52137000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90417600).
52137000 is an abundant number, since it is smaller than the sum of its proper divisors (128698200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52137000 is a wasteful number, since it uses less digits than its factorization.
52137000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1961 (or 1941 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 52137000 is about 7220.5955433053. The cubic root of 52137000 is about 373.5786192785.
The spelling of 52137000 in words is "fifty-two million, one hundred thirty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •