Base | Representation |
---|---|
bin | 11110111111001111100110… |
… | …01111100000101111001001 |
3 | 22221021110220012110011122212 |
4 | 33133213303033200233021 |
5 | 32412431333143041102 |
6 | 400532444534554505 |
7 | 20232136221120341 |
oct | 1737476317405711 |
9 | 287243805404585 |
10 | 68143737080777 |
11 | 1a792662095596 |
12 | 7786867808a35 |
13 | 2c03c0833c127 |
14 | 12b8262a77d21 |
15 | 7d2895877c52 |
hex | 3df9f33e0bc9 |
68143737080777 has 2 divisors, whose sum is σ = 68143737080778. Its totient is φ = 68143737080776.
The previous prime is 68143737080761. The next prime is 68143737080779. The reversal of 68143737080777 is 77708073734186.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63874157921161 + 4269579159616 = 7992131^2 + 2066296^2 .
It is a cyclic number.
It is not a de Polignac number, because 68143737080777 - 24 = 68143737080761 is a prime.
Together with 68143737080779, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (68143737080779) 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, 34071868540388 + 34071868540389.
It is an arithmetic number, because the mean of its divisors is an integer number (34071868540389).
Almost surely, 268143737080777 is an apocalyptic number.
It is an amenable number.
68143737080777 is a deficient number, since it is larger than the sum of its proper divisors (1).
68143737080777 is an equidigital number, since it uses as much as digits as its factorization.
68143737080777 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 232339968, while the sum is 68.
The spelling of 68143737080777 in words is "sixty-eight trillion, one hundred forty-three billion, seven hundred thirty-seven million, eighty thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •