Base | Representation |
---|---|
bin | 111101011001010100010101… |
… | …1000111010111010100010101 |
3 | 2121211010110001012122212211202 |
4 | 1322302220223013113110111 |
5 | 1031241014111212342003 |
6 | 5152323320311042245 |
7 | 221515461243532634 |
oct | 17262505307272425 |
9 | 2554113035585752 |
10 | 540041321215253 |
11 | 14708a268a83510 |
12 | 5069b761970385 |
13 | 1a2448a7966280 |
14 | 97501d478751b |
15 | 4267aaa0d3088 |
hex | 1eb2a2b1d7515 |
540041321215253 has 8 divisors (see below), whose sum is σ = 634454139609696. Its totient is φ = 453181528292400.
The previous prime is 540041321215171. The next prime is 540041321215261. The reversal of 540041321215253 is 352512123140045.
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 540041321215253 - 230 = 540040247473429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540041321245253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1888256367743 + ... + 1888256368028.
It is an arithmetic number, because the mean of its divisors is an integer number (79306767451212).
Almost surely, 2540041321215253 is an apocalyptic number.
It is an amenable number.
540041321215253 is a deficient number, since it is larger than the sum of its proper divisors (94412818394443).
540041321215253 is a wasteful number, since it uses less digits than its factorization.
540041321215253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3776512735795.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 540041321215253 its reverse (352512123140045), we get a palindrome (892553444355298).
The spelling of 540041321215253 in words is "five hundred forty trillion, forty-one billion, three hundred twenty-one million, two hundred fifteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •