Base | Representation |
---|---|
bin | 1100100100100… |
… | …0101101101110 |
3 | 10200012210100110 |
4 | 3021020231232 |
5 | 101444223023 |
6 | 5122040450 |
7 | 1210111656 |
oct | 311105556 |
9 | 120183313 |
10 | 52726638 |
11 | 27843338 |
12 | 157a9126 |
13 | ac014c3 |
14 | 7007366 |
15 | 4967a93 |
hex | 3248b6e |
52726638 has 8 divisors (see below), whose sum is σ = 105453288. Its totient is φ = 17575544.
The previous prime is 52726637. The next prime is 52726693. The reversal of 52726638 is 83662725.
52726638 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
52726638 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 52726596 and 52726605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52726637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4393881 + ... + 4393892.
It is an arithmetic number, because the mean of its divisors is an integer number (13181661).
Almost surely, 252726638 is an apocalyptic number.
52726638 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52726638 is a wasteful number, since it uses less digits than its factorization.
52726638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8787778.
The product of its digits is 120960, while the sum is 39.
The square root of 52726638 is about 7261.3110386486. The cubic root of 52726638 is about 374.9816595475.
The spelling of 52726638 in words is "fifty-two million, seven hundred twenty-six thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •