Base | Representation |
---|---|
bin | 1100100010101… |
… | …1001010000000 |
3 | 10122222122021101 |
4 | 3020223022000 |
5 | 101431334233 |
6 | 5115304144 |
7 | 1206066001 |
oct | 310531200 |
9 | 118878241 |
10 | 52605568 |
11 | 27770384 |
12 | 1574b054 |
13 | ab8b372 |
14 | 6db51a8 |
15 | 4941c7d |
hex | 322b280 |
52605568 has 32 divisors (see below), whose sum is σ = 105756660. Its totient is φ = 26062848.
The previous prime is 52605563. The next prime is 52605569. The reversal of 52605568 is 86550625.
It can be written as a sum of positive squares in 2 ways, for example, as 34012224 + 18593344 = 5832^2 + 4312^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-3 number, since 3×526055683 (a number of 24 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (52605563) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12646 + ... + 16282.
Almost surely, 252605568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52605568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52878330).
52605568 is an abundant number, since it is smaller than the sum of its proper divisors (53151092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52605568 is a wasteful number, since it uses less digits than its factorization.
52605568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3764 (or 3752 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
The square root of 52605568 is about 7252.9695987230. The cubic root of 52605568 is about 374.6944307779.
The spelling of 52605568 in words is "fifty-two million, six hundred five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •