Base | Representation |
---|---|
bin | 1100110011101… |
… | …0000100011101 |
3 | 10202002000102221 |
4 | 3030322010131 |
5 | 102222341404 |
6 | 5155145341 |
7 | 1221400111 |
oct | 314720435 |
9 | 122060387 |
10 | 53715229 |
11 | 28359057 |
12 | 15ba5251 |
13 | b189479 |
14 | 71c3741 |
15 | 4ab0954 |
hex | 333a11d |
53715229 has 2 divisors, whose sum is σ = 53715230. Its totient is φ = 53715228.
The previous prime is 53715227. The next prime is 53715239. The reversal of 53715229 is 92251735.
53715229 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., 49028004 + 4687225 = 7002^2 + 2165^2 .
It is a cyclic number.
It is not a de Polignac number, because 53715229 - 21 = 53715227 is a prime.
Together with 53715227, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 53715194 and 53715203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53715227) 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, 26857614 + 26857615.
It is an arithmetic number, because the mean of its divisors is an integer number (26857615).
Almost surely, 253715229 is an apocalyptic number.
It is an amenable number.
53715229 is a deficient number, since it is larger than the sum of its proper divisors (1).
53715229 is an equidigital number, since it uses as much as digits as its factorization.
53715229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18900, while the sum is 34.
The square root of 53715229 is about 7329.0674031557. The cubic root of 53715229 is about 377.3107195476.
The spelling of 53715229 in words is "fifty-three million, seven hundred fifteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •