Base | Representation |
---|---|
bin | 1111101110110011100… |
… | …00001100010100000101 |
3 | 1220200012001122102122001 |
4 | 13313121300030110011 |
5 | 32323443143414341 |
6 | 1052151405305301 |
7 | 54023456621524 |
oct | 7673160142405 |
9 | 1820161572561 |
10 | 540524201221 |
11 | 199264902694 |
12 | 88910565231 |
13 | 3bc819a9b74 |
14 | 1c2392864bb |
15 | e0d8663d31 |
hex | 7dd9c0c505 |
540524201221 has 16 divisors (see below), whose sum is σ = 564975323136. Its totient is φ = 516152876976.
The previous prime is 540524201207. The next prime is 540524201227. The reversal of 540524201221 is 122102425045.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 540524201221 - 215 = 540524168453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 540524201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540524201227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50402566 + ... + 50413288.
It is an arithmetic number, because the mean of its divisors is an integer number (35310957696).
Almost surely, 2540524201221 is an apocalyptic number.
It is an amenable number.
540524201221 is a deficient number, since it is larger than the sum of its proper divisors (24451121915).
540524201221 is a wasteful number, since it uses less digits than its factorization.
540524201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14232.
The product of its (nonzero) digits is 6400, while the sum is 28.
Adding to 540524201221 its reverse (122102425045), we get a palindrome (662626626266).
The spelling of 540524201221 in words is "five hundred forty billion, five hundred twenty-four million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •