Base | Representation |
---|---|
bin | 1100011011010… |
… | …0000111110000 |
3 | 10122001212110022 |
4 | 3012310013300 |
5 | 101320234000 |
6 | 5101023012 |
7 | 1201665344 |
oct | 306640760 |
9 | 118055408 |
10 | 52118000 |
11 | 27468030 |
12 | 15554a68 |
13 | aa4a46c |
14 | 6cc9624 |
15 | 4897585 |
hex | 31b41f0 |
52118000 has 160 divisors (see below), whose sum is σ = 144847872. Its totient is φ = 17952000.
The previous prime is 52117997. The next prime is 52118009. The reversal of 52118000 is 81125.
It is a self number, because there is not a number n which added to its sum of digits gives 52118000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52118009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 505949 + ... + 506051.
Almost surely, 252118000 is an apocalyptic number.
52118000 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 52118000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72423936).
52118000 is an abundant number, since it is smaller than the sum of its proper divisors (92729872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52118000 is a wasteful number, since it uses less digits than its factorization.
52118000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160 (or 144 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 52118000 is about 7219.2797424674. The cubic root of 52118000 is about 373.5332333646.
Adding to 52118000 its reverse (81125), we get a palindrome (52199125).
The spelling of 52118000 in words is "fifty-two million, one hundred eighteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •