Base | Representation |
---|---|
bin | 1100100010101… |
… | …0111011000000 |
3 | 10122222120221211 |
4 | 3020222323000 |
5 | 101431321413 |
6 | 5115255504 |
7 | 1206063130 |
oct | 310527300 |
9 | 118876854 |
10 | 52604608 |
11 | 2776a691 |
12 | 1574a594 |
13 | ab8aab4 |
14 | 6db4ac0 |
15 | 494183d |
hex | 322aec0 |
52604608 has 56 divisors (see below), whose sum is σ = 123444000. Its totient is φ = 21762048.
The previous prime is 52604593. The next prime is 52604627. The reversal of 52604608 is 80640625.
It is a tau number, because it is divible by the number of its divisors (56).
It is a self number, because there is not a number n which added to its sum of digits gives 52604608.
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 7 ways as a sum of consecutive naturals, for example, 10968 + ... + 15016.
Almost surely, 252604608 is an apocalyptic number.
52604608 is a gapful number since it is divisible by the number (58) 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 52604608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61722000).
52604608 is an abundant number, since it is smaller than the sum of its proper divisors (70839392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52604608 is a wasteful number, since it uses less digits than its factorization.
52604608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4097 (or 4087 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 52604608 is about 7252.9034186317. The cubic root of 52604608 is about 374.6921514954.
The spelling of 52604608 in words is "fifty-two million, six hundred four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •