Base | Representation |
---|---|
bin | 1100100100111… |
… | …0011101001001 |
3 | 10200020222121101 |
4 | 3021032131021 |
5 | 102001001103 |
6 | 5122341401 |
7 | 1210240351 |
oct | 311163511 |
9 | 120228541 |
10 | 52750153 |
11 | 27859a75 |
12 | 157ba861 |
13 | ac0c111 |
14 | 7011b61 |
15 | 496ea1d |
hex | 324e749 |
52750153 has 2 divisors, whose sum is σ = 52750154. Its totient is φ = 52750152.
The previous prime is 52750151. The next prime is 52750171. The reversal of 52750153 is 35105725.
52750153 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., 35676729 + 17073424 = 5973^2 + 4132^2 .
It is a cyclic number.
It is not a de Polignac number, because 52750153 - 21 = 52750151 is a prime.
Together with 52750151, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (52750151) 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, 26375076 + 26375077.
It is an arithmetic number, because the mean of its divisors is an integer number (26375077).
Almost surely, 252750153 is an apocalyptic number.
It is an amenable number.
52750153 is a deficient number, since it is larger than the sum of its proper divisors (1).
52750153 is an equidigital number, since it uses as much as digits as its factorization.
52750153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 28.
The square root of 52750153 is about 7262.9300561137. The cubic root of 52750153 is about 375.0373959744.
Adding to 52750153 its reverse (35105725), we get a palindrome (87855878).
The spelling of 52750153 in words is "fifty-two million, seven hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •