Base | Representation |
---|---|
bin | 111101011100110000100000… |
… | …1010110010110000011101001 |
3 | 2121212210122110210211111020211 |
4 | 1322321201001112112003221 |
5 | 1031321240430001043221 |
6 | 5153324433540221121 |
7 | 221564600166420130 |
oct | 17271410126260351 |
9 | 2555718423744224 |
10 | 540514140643561 |
11 | 14725183a245117 |
12 | 5075731809a7a1 |
13 | 1a27a35988c316 |
14 | 9769049ba2917 |
15 | 427502e8b36e1 |
hex | 1eb98415960e9 |
540514140643561 has 8 divisors (see below), whose sum is σ = 617730599659520. Its totient is φ = 463297719930048.
The previous prime is 540514140643541. The next prime is 540514140643577. The reversal of 540514140643561 is 165346041415045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 540514140643561 - 223 = 540514132254953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540514140643541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33705985 + ... + 47086321.
It is an arithmetic number, because the mean of its divisors is an integer number (77216324957440).
Almost surely, 2540514140643561 is an apocalyptic number.
It is an amenable number.
540514140643561 is a deficient number, since it is larger than the sum of its proper divisors (77216459015959).
540514140643561 is a wasteful number, since it uses less digits than its factorization.
540514140643561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19151223.
The product of its (nonzero) digits is 3456000, while the sum is 49.
The spelling of 540514140643561 in words is "five hundred forty trillion, five hundred fourteen billion, one hundred forty million, six hundred forty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •