Base | Representation |
---|---|
bin | 100000001110000… |
… | …001011001100101 |
3 | 1101200010121121201 |
4 | 200032001121211 |
5 | 2101334443121 |
6 | 125345442501 |
7 | 16252366534 |
oct | 4016013145 |
9 | 1350117551 |
10 | 540546661 |
11 | 258140786 |
12 | 131040431 |
13 | 87cb06c5 |
14 | 51b0c31b |
15 | 326c6e91 |
hex | 20381665 |
540546661 has 2 divisors, whose sum is σ = 540546662. Its totient is φ = 540546660.
The previous prime is 540546649. The next prime is 540546673. The reversal of 540546661 is 166645045.
It is a balanced prime because it is at equal distance from previous prime (540546649) and next prime (540546673).
It can be written as a sum of positive squares in only one way, i.e., 366148225 + 174398436 = 19135^2 + 13206^2 .
It is a cyclic number.
It is not a de Polignac number, because 540546661 - 27 = 540546533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 540546661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540546641) 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, 270273330 + 270273331.
It is an arithmetic number, because the mean of its divisors is an integer number (270273331).
Almost surely, 2540546661 is an apocalyptic number.
It is an amenable number.
540546661 is a deficient number, since it is larger than the sum of its proper divisors (1).
540546661 is an equidigital number, since it uses as much as digits as its factorization.
540546661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 37.
The square root of 540546661 is about 23249.6593738489. The cubic root of 540546661 is about 814.5999823501.
The spelling of 540546661 in words is "five hundred forty million, five hundred forty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •