Base | Representation |
---|---|
bin | 111101011101101101100000… |
… | …1001100000010101011000111 |
3 | 2121220021011120222210002111210 |
4 | 1322323123001030002223013 |
5 | 1031330412213404222010 |
6 | 5153504540200102503 |
7 | 221610215301361410 |
oct | 17273330114025307 |
9 | 2556234528702453 |
10 | 540645134445255 |
11 | 1472a234a894164 |
12 | 50778795764a33 |
13 | 1a289804610998 |
14 | 9771515244807 |
15 | 4278649ad1b20 |
hex | 1ebb6c1302ac7 |
540645134445255 has 32 divisors (see below), whose sum is σ = 990108410227200. Its totient is φ = 246777020364672.
The previous prime is 540645134445209. The next prime is 540645134445259. The reversal of 540645134445255 is 552544431546045.
It is not a de Polignac number, because 540645134445255 - 26 = 540645134445191 is a prime.
It is a super-2 number, since 2×5406451344452552 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 540645134445195 and 540645134445204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540645134445259) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3906608560 + ... + 3906746949.
It is an arithmetic number, because the mean of its divisors is an integer number (30940887819600).
Almost surely, 2540645134445255 is an apocalyptic number.
540645134445255 is a deficient number, since it is larger than the sum of its proper divisors (449463275781945).
540645134445255 is a wasteful number, since it uses less digits than its factorization.
540645134445255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7813356183.
The product of its (nonzero) digits is 115200000, while the sum is 57.
The spelling of 540645134445255 in words is "five hundred forty trillion, six hundred forty-five billion, one hundred thirty-four million, four hundred forty-five thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •