Base | Representation |
---|---|
bin | 1111101110101010101… |
… | …01010101110110100101 |
3 | 1220122222220010100010200 |
4 | 13313111111111312211 |
5 | 32323320203203131 |
6 | 1052140200141113 |
7 | 54021566441526 |
oct | 7672525256645 |
9 | 1818886110120 |
10 | 540450053541 |
11 | 199226a69412 |
12 | 888ab767799 |
13 | 3bc6c5184b8 |
14 | 1c22d4a484d |
15 | e0d1db92e6 |
hex | 7dd5555da5 |
540450053541 has 24 divisors (see below), whose sum is σ = 794551174560. Its totient is φ = 353894449056.
The previous prime is 540450053531. The next prime is 540450053551. The reversal of 540450053541 is 145350054045.
540450053541 is a `hidden beast` number, since 5 + 40 + 45 + 0 + 0 + 535 + 41 = 666.
It is an interprime number because it is at equal distance from previous prime (540450053531) and next prime (540450053551).
It is not a de Polignac number, because 540450053541 - 27 = 540450053413 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 540450053496 and 540450053505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540450053531) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 201571 + ... + 1059023.
It is an arithmetic number, because the mean of its divisors is an integer number (33106298940).
Almost surely, 2540450053541 is an apocalyptic number.
It is an amenable number.
540450053541 is a deficient number, since it is larger than the sum of its proper divisors (254101121019).
540450053541 is a wasteful number, since it uses less digits than its factorization.
540450053541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 858705 (or 858702 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
The spelling of 540450053541 in words is "five hundred forty billion, four hundred fifty million, fifty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •