Base | Representation |
---|---|
bin | 100000001011111… |
… | …100110011001101 |
3 | 1101122010000120212 |
4 | 200023330303031 |
5 | 2101220103113 |
6 | 125330052205 |
7 | 16244645216 |
oct | 4013746315 |
9 | 1348100525 |
10 | 540003533 |
11 | 2578aa713 |
12 | 130a1a065 |
13 | 87b50424 |
14 | 51a0a40d |
15 | 3261b0a8 |
hex | 202fcccd |
540003533 has 2 divisors, whose sum is σ = 540003534. Its totient is φ = 540003532.
The previous prime is 540003523. The next prime is 540003571. The reversal of 540003533 is 335300045.
540003533 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., 455694409 + 84309124 = 21347^2 + 9182^2 .
It is a cyclic number.
It is not a de Polignac number, because 540003533 - 210 = 540002509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 540003499 and 540003508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540003523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270001766 + 270001767.
It is an arithmetic number, because the mean of its divisors is an integer number (270001767).
Almost surely, 2540003533 is an apocalyptic number.
It is an amenable number.
540003533 is a deficient number, since it is larger than the sum of its proper divisors (1).
540003533 is an equidigital number, since it uses as much as digits as its factorization.
540003533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 23.
The square root of 540003533 is about 23237.9760951766. The cubic root of 540003533 is about 814.3270609075.
Adding to 540003533 its reverse (335300045), we get a palindrome (875303578).
The spelling of 540003533 in words is "five hundred forty million, three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •