Base | Representation |
---|---|
bin | 100000001011111… |
… | …111011111110101 |
3 | 1101122010120202001 |
4 | 200023333133311 |
5 | 2101220431311 |
6 | 125330215301 |
7 | 16245022351 |
oct | 4013773765 |
9 | 1348116661 |
10 | 540014581 |
11 | 257907a47 |
12 | 130a24531 |
13 | 87b55472 |
14 | 51a10461 |
15 | 3261e4c1 |
hex | 202ff7f5 |
540014581 has 2 divisors, whose sum is σ = 540014582. Its totient is φ = 540014580.
The previous prime is 540014549. The next prime is 540014609. The reversal of 540014581 is 185410045.
It is an a-pointer prime, because the next prime (540014609) can be obtained adding 540014581 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 532224900 + 7789681 = 23070^2 + 2791^2 .
It is a cyclic number.
It is not a de Polignac number, because 540014581 - 25 = 540014549 is a prime.
It is a super-2 number, since 2×5400145812 = 583231495385211122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540014281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270007290 + 270007291.
It is an arithmetic number, because the mean of its divisors is an integer number (270007291).
Almost surely, 2540014581 is an apocalyptic number.
It is an amenable number.
540014581 is a deficient number, since it is larger than the sum of its proper divisors (1).
540014581 is an equidigital number, since it uses as much as digits as its factorization.
540014581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3200, while the sum is 28.
The square root of 540014581 is about 23238.2138082943. The cubic root of 540014581 is about 814.3326143427.
The spelling of 540014581 in words is "five hundred forty million, fourteen thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •