Base | Representation |
---|---|
bin | 1100011010100… |
… | …1010011001101 |
3 | 10121222121122201 |
4 | 3012221103031 |
5 | 101312324202 |
6 | 5100041501 |
7 | 1201422205 |
oct | 306512315 |
9 | 117877581 |
10 | 52073677 |
11 | 274377a7 |
12 | 15533291 |
13 | aa33236 |
14 | 6cb7405 |
15 | 4889387 |
hex | 31a94cd |
52073677 has 4 divisors (see below), whose sum is σ = 52534620. Its totient is φ = 51612736.
The previous prime is 52073663. The next prime is 52073711. The reversal of 52073677 is 77637025.
52073677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25664356 + 26409321 = 5066^2 + 5139^2 .
It is a cyclic number.
It is not a de Polignac number, because 52073677 - 223 = 43685069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52073627) 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, 230302 + ... + 230527.
It is an arithmetic number, because the mean of its divisors is an integer number (13133655).
Almost surely, 252073677 is an apocalyptic number.
It is an amenable number.
52073677 is a deficient number, since it is larger than the sum of its proper divisors (460943).
52073677 is a wasteful number, since it uses less digits than its factorization.
52073677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460942.
The product of its (nonzero) digits is 61740, while the sum is 37.
The square root of 52073677 is about 7216.2093234606. The cubic root of 52073677 is about 373.4273146863.
The spelling of 52073677 in words is "fifty-two million, seventy-three thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •