Base | Representation |
---|---|
bin | 1100011010101… |
… | …0000011011011 |
3 | 10121222202220000 |
4 | 3012222003123 |
5 | 101312424023 |
6 | 5100104043 |
7 | 1201434204 |
oct | 306520333 |
9 | 117882800 |
10 | 52076763 |
11 | 2743a052 |
12 | 15535023 |
13 | aa3476b |
14 | 6cb85ab |
15 | 488a243 |
hex | 31aa0db |
52076763 has 40 divisors (see below), whose sum is σ = 83896560. Its totient is φ = 32071680.
The previous prime is 52076693. The next prime is 52076789. The reversal of 52076763 is 36767025.
It is a happy number.
52076763 is a `hidden beast` number, since 520 + 76 + 7 + 63 = 666.
52076763 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 52076763 - 29 = 52076251 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52076863) 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 39 ways as a sum of consecutive naturals, for example, 80923 + ... + 81563.
It is an arithmetic number, because the mean of its divisors is an integer number (2097414).
Almost surely, 252076763 is an apocalyptic number.
52076763 is a deficient number, since it is larger than the sum of its proper divisors (31819797).
52076763 is a wasteful number, since it uses less digits than its factorization.
52076763 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729 (or 720 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 36.
The square root of 52076763 is about 7216.4231444671. The cubic root of 52076763 is about 373.4346912471.
The spelling of 52076763 in words is "fifty-two million, seventy-six thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •