Base | Representation |
---|---|
bin | 1100011010011… |
… | …0001001101101 |
3 | 10121221221222002 |
4 | 3012212021231 |
5 | 101311421111 |
6 | 5055502045 |
7 | 1201336463 |
oct | 306461155 |
9 | 117857862 |
10 | 52060781 |
11 | 27429043 |
12 | 15527925 |
13 | aa2a3c6 |
14 | 6cb2833 |
15 | 488563b |
hex | 31a626d |
52060781 has 2 divisors, whose sum is σ = 52060782. Its totient is φ = 52060780.
The previous prime is 52060751. The next prime is 52060843. The reversal of 52060781 is 18706025.
52060781 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49140100 + 2920681 = 7010^2 + 1709^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52060781 is a prime.
It is a super-2 number, since 2×520607812 = 5420649836659922, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52060721) 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 as a sum of consecutive naturals, namely, 26030390 + 26030391.
It is an arithmetic number, because the mean of its divisors is an integer number (26030391).
Almost surely, 252060781 is an apocalyptic number.
It is an amenable number.
52060781 is a deficient number, since it is larger than the sum of its proper divisors (1).
52060781 is an equidigital number, since it uses as much as digits as its factorization.
52060781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 52060781 is about 7215.3157242078. The cubic root of 52060781 is about 373.3964858267.
The spelling of 52060781 in words is "fifty-two million, sixty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •