Base | Representation |
---|---|
bin | 1100100100001… |
… | …1110101010000 |
3 | 10200011202220210 |
4 | 3021003311100 |
5 | 101443103030 |
6 | 5121404120 |
7 | 1206666450 |
oct | 311036520 |
9 | 120152823 |
10 | 52706640 |
11 | 2782a308 |
12 | 15799640 |
13 | abc537c |
14 | 6dddd60 |
15 | 4961bb0 |
hex | 3243d50 |
52706640 has 160 divisors (see below), whose sum is σ = 188916480. Its totient is φ = 11907072.
The previous prime is 52706617. The next prime is 52706653. The reversal of 52706640 is 4660725.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 52706598 and 52706607.
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, 230046 + ... + 230274.
It is an arithmetic number, because the mean of its divisors is an integer number (1180728).
Almost surely, 252706640 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 52706640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94458240).
52706640 is an abundant number, since it is smaller than the sum of its proper divisors (136209840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52706640 is a wasteful number, since it uses less digits than its factorization.
52706640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389 (or 383 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 52706640 is about 7259.9338839965. The cubic root of 52706640 is about 374.9342462490.
The spelling of 52706640 in words is "fifty-two million, seven hundred six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •