Base | Representation |
---|---|
bin | 11110000000111111100001… |
… | …10010101000100010110101 |
3 | 22122200222221011012021110201 |
4 | 33000133300302220202311 |
5 | 32122410313333231431 |
6 | 352214104302120501 |
7 | 16621455350020405 |
oct | 1700376062504265 |
9 | 278628834167421 |
10 | 66004802242741 |
11 | 1a03853014060a |
12 | 74a020a880131 |
13 | 2aaa2c2ab962b |
14 | 124291422a805 |
15 | 796e0a42c461 |
hex | 3c07f0ca88b5 |
66004802242741 has 2 divisors, whose sum is σ = 66004802242742. Its totient is φ = 66004802242740.
The previous prime is 66004802242739. The next prime is 66004802242891. The reversal of 66004802242741 is 14724220840066.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 55995513490225 + 10009288752516 = 7483015^2 + 3163746^2 .
It is a cyclic number.
It is not a de Polignac number, because 66004802242741 - 21 = 66004802242739 is a prime.
Together with 66004802242739, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 66004802242691 and 66004802242700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66004802243741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33002401121370 + 33002401121371.
It is an arithmetic number, because the mean of its divisors is an integer number (33002401121371).
Almost surely, 266004802242741 is an apocalyptic number.
It is an amenable number.
66004802242741 is a deficient number, since it is larger than the sum of its proper divisors (1).
66004802242741 is an equidigital number, since it uses as much as digits as its factorization.
66004802242741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1032192, while the sum is 46.
The spelling of 66004802242741 in words is "sixty-six trillion, four billion, eight hundred two million, two hundred forty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •