Base | Representation |
---|---|
bin | 1100100010110… |
… | …1110001000111 |
3 | 10200000011221111 |
4 | 3020231301013 |
5 | 101432210023 |
6 | 5115425451 |
7 | 1206142120 |
oct | 310556107 |
9 | 120004844 |
10 | 52616263 |
11 | 27778417 |
12 | 15755287 |
13 | ab931ab |
14 | 6db9047 |
15 | 494500d |
hex | 322dc47 |
52616263 has 8 divisors (see below), whose sum is σ = 63297920. Its totient is φ = 42725880.
The previous prime is 52616251. The next prime is 52616299. The reversal of 52616263 is 36261625.
52616263 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.
It is a cyclic number.
It is not a de Polignac number, because 52616263 - 213 = 52608071 is a prime.
It is a super-2 number, since 2×526162632 = 5536942264170338, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52611263) 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 7 ways as a sum of consecutive naturals, for example, 197673 + ... + 197938.
It is an arithmetic number, because the mean of its divisors is an integer number (7912240).
Almost surely, 252616263 is an apocalyptic number.
52616263 is a deficient number, since it is larger than the sum of its proper divisors (10681657).
52616263 is a wasteful number, since it uses less digits than its factorization.
52616263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395637.
The product of its digits is 12960, while the sum is 31.
The square root of 52616263 is about 7253.7068454687. The cubic root of 52616263 is about 374.7198215337.
Adding to 52616263 its reverse (36261625), we get a palindrome (88877888).
The spelling of 52616263 in words is "fifty-two million, six hundred sixteen thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •