Base | Representation |
---|---|
bin | 100000001111011… |
… | …111110000000001 |
3 | 1101200212020202001 |
4 | 200033133300001 |
5 | 2101434324441 |
6 | 125402024001 |
7 | 16255566331 |
oct | 4017376001 |
9 | 1350766661 |
10 | 540933121 |
11 | 258385073 |
12 | 1311a8001 |
13 | 880b7591 |
14 | 51bad0c1 |
15 | 32751731 |
hex | 203dfc01 |
540933121 has 2 divisors, whose sum is σ = 540933122. Its totient is φ = 540933120.
The previous prime is 540933103. The next prime is 540933209. The reversal of 540933121 is 121339045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 527161600 + 13771521 = 22960^2 + 3711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-540933121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 540933121.
It is not a weakly prime, because it can be changed into another prime (540933721) 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, 270466560 + 270466561.
It is an arithmetic number, because the mean of its divisors is an integer number (270466561).
Almost surely, 2540933121 is an apocalyptic number.
It is an amenable number.
540933121 is a deficient number, since it is larger than the sum of its proper divisors (1).
540933121 is an equidigital number, since it uses as much as digits as its factorization.
540933121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 540933121 is about 23257.9689783953. The cubic root of 540933121 is about 814.7940669302.
It can be divided in two parts, 540 and 933121, that added together give a triangular number (933661 = T1366).
The spelling of 540933121 in words is "five hundred forty million, nine hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •