Base | Representation |
---|---|
bin | 111101101101001001001110… |
… | …1001000101000011111111111 |
3 | 2122011202221112201112002221012 |
4 | 1323122102131020220133333 |
5 | 1032120140231303303223 |
6 | 5202211211530425435 |
7 | 222216365330220062 |
oct | 17332223510503777 |
9 | 2564687481462835 |
10 | 542766243416063 |
11 | 147a3a964581267 |
12 | 50a5b89889227b |
13 | 1a3b1838a31354 |
14 | 98060524328d9 |
15 | 42b38e00bdc78 |
hex | 1eda49d2287ff |
542766243416063 has 2 divisors, whose sum is σ = 542766243416064. Its totient is φ = 542766243416062.
The previous prime is 542766243416009. The next prime is 542766243416077. The reversal of 542766243416063 is 360614342667245.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 542766243416063 - 28 = 542766243415807 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 542766243415993 and 542766243416011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (542766243416093) 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 as a sum of consecutive naturals, namely, 271383121708031 + 271383121708032.
It is an arithmetic number, because the mean of its divisors is an integer number (271383121708032).
Almost surely, 2542766243416063 is an apocalyptic number.
542766243416063 is a deficient number, since it is larger than the sum of its proper divisors (1).
542766243416063 is an equidigital number, since it uses as much as digits as its factorization.
542766243416063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104509440, while the sum is 59.
The spelling of 542766243416063 in words is "five hundred forty-two trillion, seven hundred sixty-six billion, two hundred forty-three million, four hundred sixteen thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •