Base | Representation |
---|---|
bin | 111101011011010010110110… |
… | …1101111101010011000100011 |
3 | 2121212002102100111122120212101 |
4 | 1322312211231233222120203 |
5 | 1031304442032113440021 |
6 | 5153052213050111231 |
7 | 221544220243322320 |
oct | 17266455557523043 |
9 | 2555072314576771 |
10 | 540313022015011 |
11 | 147184513aa5813 |
12 | 50724349a1b517 |
13 | 1a2643b789937b |
14 | 975d40b2d3b47 |
15 | 426ebad128a91 |
hex | 1eb696dbea623 |
540313022015011 has 8 divisors (see below), whose sum is σ = 638793720609120. Its totient is φ = 447155604426048.
The previous prime is 540313022014979. The next prime is 540313022015023. The reversal of 540313022015011 is 110510220313045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 540313022015011 - 25 = 540313022014979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540313022055011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1330820251066 + ... + 1330820251471.
It is an arithmetic number, because the mean of its divisors is an integer number (79849215076140).
Almost surely, 2540313022015011 is an apocalyptic number.
540313022015011 is a deficient number, since it is larger than the sum of its proper divisors (98480698594109).
540313022015011 is a wasteful number, since it uses less digits than its factorization.
540313022015011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2661640502573.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 540313022015011 its reverse (110510220313045), we get a palindrome (650823242328056).
The spelling of 540313022015011 in words is "five hundred forty trillion, three hundred thirteen billion, twenty-two million, fifteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •