Base | Representation |
---|---|
bin | 1100101011011… |
… | …0001100010101 |
3 | 10201001120110201 |
4 | 3022312030111 |
5 | 102103100221 |
6 | 5135420501 |
7 | 1213660222 |
oct | 312661425 |
9 | 121046421 |
10 | 53175061 |
11 | 2801a235 |
12 | 15984731 |
13 | b02a644 |
14 | 70c2949 |
15 | 4a05891 |
hex | 32b6315 |
53175061 has 2 divisors, whose sum is σ = 53175062. Its totient is φ = 53175060.
The previous prime is 53175007. The next prime is 53175071. The reversal of 53175061 is 16057135.
53175061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48790225 + 4384836 = 6985^2 + 2094^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53175061 is a prime.
It is a super-2 number, since 2×531750612 = 5655174224707442, 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 (53175071) 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, 26587530 + 26587531.
It is an arithmetic number, because the mean of its divisors is an integer number (26587531).
Almost surely, 253175061 is an apocalyptic number.
It is an amenable number.
53175061 is a deficient number, since it is larger than the sum of its proper divisors (1).
53175061 is an equidigital number, since it uses as much as digits as its factorization.
53175061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
The square root of 53175061 is about 7292.1232161833. The cubic root of 53175061 is about 376.0416926945.
The spelling of 53175061 in words is "fifty-three million, one hundred seventy-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •