Base | Representation |
---|---|
bin | 1100100100111… |
… | …0011011011111 |
3 | 10200020222110110 |
4 | 3021032123133 |
5 | 102001000142 |
6 | 5122341103 |
7 | 1210240140 |
oct | 311163337 |
9 | 120228413 |
10 | 52750047 |
11 | 27859989 |
12 | 157ba793 |
13 | ac0c05c |
14 | 7011ac7 |
15 | 496e99c |
hex | 324e6df |
52750047 has 16 divisors (see below), whose sum is σ = 80835840. Its totient is φ = 29972352.
The previous prime is 52750039. The next prime is 52750051. The reversal of 52750047 is 74005725.
It is not a de Polignac number, because 52750047 - 23 = 52750039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52749996 and 52750023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52750007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3258 + ... + 10775.
It is an arithmetic number, because the mean of its divisors is an integer number (5052240).
Almost surely, 252750047 is an apocalyptic number.
52750047 is a deficient number, since it is larger than the sum of its proper divisors (28085793).
52750047 is a wasteful number, since it uses less digits than its factorization.
52750047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14222.
The product of its (nonzero) digits is 9800, while the sum is 30.
The square root of 52750047 is about 7262.9227587797. The cubic root of 52750047 is about 375.0371447650.
The spelling of 52750047 in words is "fifty-two million, seven hundred fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •