Base | Representation |
---|---|
bin | 1001011010001101101111011… |
… | …0110010101100100101110111 |
3 | 10012211110011102020100020011102 |
4 | 2112203123312302230211313 |
5 | 1143242013424032440434 |
6 | 10304131511140000315 |
7 | 256320120503356004 |
oct | 22643336662544567 |
9 | 3184404366306142 |
10 | 662142068640119 |
11 | 181a84968814a01 |
12 | 6231b69b09009b |
13 | 22560962c3c372 |
14 | b971bc06c88ab |
15 | 5183c7c39007e |
hex | 25a36f6cac977 |
662142068640119 has 2 divisors, whose sum is σ = 662142068640120. Its totient is φ = 662142068640118.
The previous prime is 662142068639999. The next prime is 662142068640121. The reversal of 662142068640119 is 911046860241266.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 662142068640119 - 236 = 662073349163383 is a prime.
It is a super-2 number, since 2×6621420686401192 (a number of 30 digits) contains 22 as substring.
Together with 662142068640121, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (662142068640149) 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, 331071034320059 + 331071034320060.
It is an arithmetic number, because the mean of its divisors is an integer number (331071034320060).
Almost surely, 2662142068640119 is an apocalyptic number.
662142068640119 is a deficient number, since it is larger than the sum of its proper divisors (1).
662142068640119 is an equidigital number, since it uses as much as digits as its factorization.
662142068640119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5971968, while the sum is 56.
The spelling of 662142068640119 in words is "six hundred sixty-two trillion, one hundred forty-two billion, sixty-eight million, six hundred forty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •