Base | Representation |
---|---|
bin | 100000001010111… |
… | …100111101100101 |
3 | 1101121121201220102 |
4 | 200022330331211 |
5 | 2101133221203 |
6 | 125320313445 |
7 | 16242505664 |
oct | 4012747545 |
9 | 1347551812 |
10 | 539742053 |
11 | 257741214 |
12 | 130912885 |
13 | 87a8b3c6 |
14 | 5197cddb |
15 | 325b8888 |
hex | 202bcf65 |
539742053 has 2 divisors, whose sum is σ = 539742054. Its totient is φ = 539742052.
The previous prime is 539742043. The next prime is 539742067. The reversal of 539742053 is 350247935.
539742053 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., 430894564 + 108847489 = 20758^2 + 10433^2 .
It is a cyclic number.
It is not a de Polignac number, because 539742053 - 24 = 539742037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 539741998 and 539742016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (539742043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 269871026 + 269871027.
It is an arithmetic number, because the mean of its divisors is an integer number (269871027).
Almost surely, 2539742053 is an apocalyptic number.
It is an amenable number.
539742053 is a deficient number, since it is larger than the sum of its proper divisors (1).
539742053 is an equidigital number, since it uses as much as digits as its factorization.
539742053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 38.
The square root of 539742053 is about 23232.3492785383. The cubic root of 539742053 is about 814.1956021272.
Adding to 539742053 its reverse (350247935), we get a palindrome (889989988).
The spelling of 539742053 in words is "five hundred thirty-nine million, seven hundred forty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •