Base | Representation |
---|---|
bin | 100000001101001… |
… | …001110110100011 |
3 | 1101122201001111222 |
4 | 200031021312203 |
5 | 2101310203024 |
6 | 125340525255 |
7 | 16250431313 |
oct | 4015116643 |
9 | 1348631458 |
10 | 540319139 |
11 | 257aa5848 |
12 | 130b5082b |
13 | 87c30c89 |
14 | 51a8d443 |
15 | 3267e85e |
hex | 20349da3 |
540319139 has 2 divisors, whose sum is σ = 540319140. Its totient is φ = 540319138.
The previous prime is 540319099. The next prime is 540319141. The reversal of 540319139 is 931913045.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 540319139 - 212 = 540315043 is a prime.
Together with 540319141, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p28364192 and since 540319139 and 28364192 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 540319099 and 540319108.
It is not a weakly prime, because it can be changed into another prime (540310139) 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, 270159569 + 270159570.
It is an arithmetic number, because the mean of its divisors is an integer number (270159570).
Almost surely, 2540319139 is an apocalyptic number.
540319139 is a deficient number, since it is larger than the sum of its proper divisors (1).
540319139 is an equidigital number, since it uses as much as digits as its factorization.
540319139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 540319139 is about 23244.7658409372. The cubic root of 540319139 is about 814.4856749644.
It can be divided in two parts, 5403 and 19139, that added together give a palindrome (24542).
The spelling of 540319139 in words is "five hundred forty million, three hundred nineteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •