Base | Representation |
---|---|
bin | 100110110011001110010… |
… | …101101001100000011101 |
3 | 100102220021220221112202001 |
4 | 212303032111221200131 |
5 | 322141131411130203 |
6 | 5400522252002301 |
7 | 363431266562512 |
oct | 46631625514035 |
9 | 10386256845661 |
10 | 2666341505053 |
11 | 9388752a5006 |
12 | 370908460391 |
13 | 1645866b81c5 |
14 | 930a18d1309 |
15 | 4955719291d |
hex | 26cce56981d |
2666341505053 has 2 divisors, whose sum is σ = 2666341505054. Its totient is φ = 2666341505052.
The previous prime is 2666341505039. The next prime is 2666341505071. The reversal of 2666341505053 is 3505051436662.
2666341505053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2458818435844 + 207523069209 = 1568062^2 + 455547^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2666341505053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2666341504994 and 2666341505012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2666341505033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1333170752526 + 1333170752527.
It is an arithmetic number, because the mean of its divisors is an integer number (1333170752527).
Almost surely, 22666341505053 is an apocalyptic number.
It is an amenable number.
2666341505053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2666341505053 is an equidigital number, since it uses as much as digits as its factorization.
2666341505053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944000, while the sum is 46.
The spelling of 2666341505053 in words is "two trillion, six hundred sixty-six billion, three hundred forty-one million, five hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •