Base | Representation |
---|---|
bin | 1100101100110… |
… | …1100100001101 |
3 | 10201020102210111 |
4 | 3023031210031 |
5 | 102114131142 |
6 | 5141440021 |
7 | 1214536306 |
oct | 313154415 |
9 | 121212714 |
10 | 53270797 |
11 | 28085158 |
12 | 15a10011 |
13 | b0620a8 |
14 | 71097ad |
15 | 4a23e17 |
hex | 32cd90d |
53270797 has 2 divisors, whose sum is σ = 53270798. Its totient is φ = 53270796.
The previous prime is 53270779. The next prime is 53270821. The reversal of 53270797 is 79707235.
53270797 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (53270779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41615401 + 11655396 = 6451^2 + 3414^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53270797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53270747) 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, 26635398 + 26635399.
It is an arithmetic number, because the mean of its divisors is an integer number (26635399).
Almost surely, 253270797 is an apocalyptic number.
It is an amenable number.
53270797 is a deficient number, since it is larger than the sum of its proper divisors (1).
53270797 is an equidigital number, since it uses as much as digits as its factorization.
53270797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 92610, while the sum is 40.
The square root of 53270797 is about 7298.6846075166. The cubic root of 53270797 is about 376.2672316549.
The spelling of 53270797 in words is "fifty-three million, two hundred seventy thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •