Base | Representation |
---|---|
bin | 1100100011011… |
… | …1101001100101 |
3 | 10200002020110200 |
4 | 3020313221211 |
5 | 101440003431 |
6 | 5120341113 |
7 | 1206401124 |
oct | 310675145 |
9 | 120066420 |
10 | 52656741 |
11 | 277a5875 |
12 | 15774799 |
13 | aba8747 |
14 | 6dc9abb |
15 | 4951ee6 |
hex | 3237a65 |
52656741 has 12 divisors (see below), whose sum is σ = 76845132. Its totient is φ = 34742016.
The previous prime is 52656731. The next prime is 52656763. The reversal of 52656741 is 14765625.
It is a happy number.
52656741 is a `hidden beast` number, since 52 + 6 + 567 + 41 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 8381025 + 44275716 = 2895^2 + 6654^2 .
It is not a de Polignac number, because 52656741 - 26 = 52656677 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 junction number, because it is equal to n+sod(n) for n = 52656696 and 52656705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52656731) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29286 + ... + 31031.
It is an arithmetic number, because the mean of its divisors is an integer number (6403761).
Almost surely, 252656741 is an apocalyptic number.
It is an amenable number.
52656741 is a deficient number, since it is larger than the sum of its proper divisors (24188391).
52656741 is a wasteful number, since it uses less digits than its factorization.
52656741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60420 (or 60417 counting only the distinct ones).
The product of its digits is 50400, while the sum is 36.
The square root of 52656741 is about 7256.4964686824. The cubic root of 52656741 is about 374.8158882891.
The spelling of 52656741 in words is "fifty-two million, six hundred fifty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •