Base | Representation |
---|---|
bin | 1100100001110… |
… | …1110001100101 |
3 | 10122212212002100 |
4 | 3020131301211 |
5 | 101423111012 |
6 | 5114202313 |
7 | 1205450130 |
oct | 310356145 |
9 | 118785070 |
10 | 52550757 |
11 | 27733186 |
12 | 15723399 |
13 | ab6c42c |
14 | 6d9d217 |
15 | 49308dc |
hex | 321dc65 |
52550757 has 48 divisors (see below), whose sum is σ = 92776320. Its totient is φ = 27979776.
The previous prime is 52550741. The next prime is 52550759. The reversal of 52550757 is 75705525.
52550757 is a `hidden beast` number, since 52 + 550 + 7 + 57 = 666.
52550757 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52550757 - 24 = 52550741 is a prime.
It is a super-2 number, since 2×525507572 = 5523164122546098, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52550759) 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 47 ways as a sum of consecutive naturals, for example, 148693 + ... + 149045.
It is an arithmetic number, because the mean of its divisors is an integer number (1932840).
Almost surely, 252550757 is an apocalyptic number.
It is an amenable number.
52550757 is a deficient number, since it is larger than the sum of its proper divisors (40225563).
52550757 is a wasteful number, since it uses less digits than its factorization.
52550757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522 (or 519 counting only the distinct ones).
The product of its (nonzero) digits is 61250, while the sum is 36.
The square root of 52550757 is about 7249.1900926931. The cubic root of 52550757 is about 374.5642511907.
The spelling of 52550757 in words is "fifty-two million, five hundred fifty thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •