Base | Representation |
---|---|
bin | 1100101000101… |
… | …1010000100000 |
3 | 10200201122020100 |
4 | 3022023100200 |
5 | 102031433300 |
6 | 5131542400 |
7 | 1212325422 |
oct | 312132040 |
9 | 120648210 |
10 | 52999200 |
11 | 27a0a0a1 |
12 | 158baa00 |
13 | ac98597 |
14 | 7078812 |
15 | 49bd700 |
hex | 328b420 |
52999200 has 216 divisors, whose sum is σ = 198338868. Its totient is φ = 13271040.
The previous prime is 52999159. The next prime is 52999201. The reversal of 52999200 is 299925.
It can be written as a sum of positive squares in 6 ways, for example, as 15397776 + 37601424 = 3924^2 + 6132^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52999201) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 122184 + ... + 122616.
Almost surely, 252999200 is an apocalyptic number.
52999200 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 52999200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99169434).
52999200 is an abundant number, since it is smaller than the sum of its proper divisors (145339668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52999200 is a wasteful number, since it uses less digits than its factorization.
52999200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476 (or 460 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 36.
The square root of 52999200 is about 7280.0549448476. The cubic root of 52999200 is about 375.6266854575.
The spelling of 52999200 in words is "fifty-two million, nine hundred ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •