Base | Representation |
---|---|
bin | 100110110011000000000… |
… | …100001010011111011101 |
3 | 100102212200020100111012001 |
4 | 212303000010022133131 |
5 | 322140134110244131 |
6 | 5400442415242301 |
7 | 363422331300322 |
oct | 46630004123735 |
9 | 10385606314161 |
10 | 2666102040541 |
11 | 938762107855 |
12 | 370860219391 |
13 | 164548bc4024 |
14 | 9307bb98b49 |
15 | 49541140261 |
hex | 26cc010a7dd |
2666102040541 has 2 divisors, whose sum is σ = 2666102040542. Its totient is φ = 2666102040540.
The previous prime is 2666102040533. The next prime is 2666102040577. The reversal of 2666102040541 is 1450402016662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2654276348025 + 11825692516 = 1629195^2 + 108746^2 .
It is a cyclic number.
It is not a de Polignac number, because 2666102040541 - 23 = 2666102040533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2666102040541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2666102040241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1333051020270 + 1333051020271.
It is an arithmetic number, because the mean of its divisors is an integer number (1333051020271).
Almost surely, 22666102040541 is an apocalyptic number.
It is an amenable number.
2666102040541 is a deficient number, since it is larger than the sum of its proper divisors (1).
2666102040541 is an equidigital number, since it uses as much as digits as its factorization.
2666102040541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 2666102040541 in words is "two trillion, six hundred sixty-six billion, one hundred two million, forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •