Base | Representation |
---|---|
bin | 1100011010100… |
… | …1111010000101 |
3 | 10121222202001212 |
4 | 3012221322011 |
5 | 101312414130 |
6 | 5100101205 |
7 | 1201432361 |
oct | 306517205 |
9 | 117882055 |
10 | 52076165 |
11 | 27439659 |
12 | 15534805 |
13 | aa343cb |
14 | 6cb82a1 |
15 | 4889e95 |
hex | 31a9e85 |
52076165 has 8 divisors (see below), whose sum is σ = 62536320. Its totient is φ = 41630992.
The previous prime is 52076161. The next prime is 52076179. The reversal of 52076165 is 56167025.
It is a happy number.
52076165 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 52076165 - 22 = 52076161 is a prime.
It is a super-2 number, since 2×520761652 = 5423853922214450, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52076161) 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, 6416 + ... + 12054.
It is an arithmetic number, because the mean of its divisors is an integer number (7817040).
Almost surely, 252076165 is an apocalyptic number.
It is an amenable number.
52076165 is a deficient number, since it is larger than the sum of its proper divisors (10460155).
52076165 is a wasteful number, since it uses less digits than its factorization.
52076165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7491.
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 52076165 is about 7216.3817110793. The cubic root of 52076165 is about 373.4332618521.
The spelling of 52076165 in words is "fifty-two million, seventy-six thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •