Base | Representation |
---|---|
bin | 100000001101001… |
… | …000000111001101 |
3 | 1101122200200202001 |
4 | 200031020013031 |
5 | 2101304441023 |
6 | 125340432301 |
7 | 16250401453 |
oct | 4015100715 |
9 | 1348620661 |
10 | 540312013 |
11 | 257aa045a |
12 | 130b48691 |
13 | 87c2a967 |
14 | 51a8a9d3 |
15 | 3267c6ad |
hex | 203481cd |
540312013 has 2 divisors, whose sum is σ = 540312014. Its totient is φ = 540312012.
The previous prime is 540312011. The next prime is 540312041. The reversal of 540312013 is 310213045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 526151844 + 14160169 = 22938^2 + 3763^2 .
It is a cyclic number.
It is not a de Polignac number, because 540312013 - 21 = 540312011 is a prime.
It is a super-2 number, since 2×5403120132 = 583874142784224338, which contains 22 as substring.
Together with 540312011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540312011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270156006 + 270156007.
It is an arithmetic number, because the mean of its divisors is an integer number (270156007).
Almost surely, 2540312013 is an apocalyptic number.
It is an amenable number.
540312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
540312013 is an equidigital number, since it uses as much as digits as its factorization.
540312013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 540312013 is about 23244.6125586124. The cubic root of 540312013 is about 814.4820943333.
Adding to 540312013 its reverse (310213045), we get a palindrome (850525058).
The spelling of 540312013 in words is "five hundred forty million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •