Base | Representation |
---|---|
bin | 111101011011001011010011… |
… | …1010010010000011100110101 |
3 | 2121212000212111111012200200101 |
4 | 1322312112213102100130311 |
5 | 1031304210330211002312 |
6 | 5153040532105114101 |
7 | 221543104365336322 |
oct | 17266264722203465 |
9 | 2555025444180611 |
10 | 540296807515957 |
11 | 147178653374678 |
12 | 50721183788931 |
13 | 1a262a0255052b |
14 | 975c70da87b49 |
15 | 426e55e8b2a57 |
hex | 1eb65a7490735 |
540296807515957 has 2 divisors, whose sum is σ = 540296807515958. Its totient is φ = 540296807515956.
The previous prime is 540296807515921. The next prime is 540296807515963. The reversal of 540296807515957 is 759515708692045.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 358517221571601 + 181779585944356 = 18934551^2 + 13482566^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-540296807515957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 540296807515957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540296807515057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270148403757978 + 270148403757979.
It is an arithmetic number, because the mean of its divisors is an integer number (270148403757979).
Almost surely, 2540296807515957 is an apocalyptic number.
It is an amenable number.
540296807515957 is a deficient number, since it is larger than the sum of its proper divisors (1).
540296807515957 is an equidigital number, since it uses as much as digits as its factorization.
540296807515957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 952560000, while the sum is 73.
The spelling of 540296807515957 in words is "five hundred forty trillion, two hundred ninety-six billion, eight hundred seven million, five hundred fifteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •