Base | Representation |
---|---|
bin | 100110110000001111000… |
… | …111101101010000010101 |
3 | 100102121000100100000212101 |
4 | 212300033013231100111 |
5 | 322113044122332013 |
6 | 5355232051122101 |
7 | 363255633264001 |
oct | 46601707552025 |
9 | 10377010300771 |
10 | 2663133402133 |
11 | 937479417886 |
12 | 370171ba3331 |
13 | 164194b70459 |
14 | 92c797d7701 |
15 | 4941a6e38dd |
hex | 26c0f1ed415 |
2663133402133 has 2 divisors, whose sum is σ = 2663133402134. Its totient is φ = 2663133402132.
The previous prime is 2663133402089. The next prime is 2663133402227. The reversal of 2663133402133 is 3312043313662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2211546714129 + 451586688004 = 1487127^2 + 672002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2663133402133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2663133402092 and 2663133402101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2663133462133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1331566701066 + 1331566701067.
It is an arithmetic number, because the mean of its divisors is an integer number (1331566701067).
Almost surely, 22663133402133 is an apocalyptic number.
It is an amenable number.
2663133402133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2663133402133 is an equidigital number, since it uses as much as digits as its factorization.
2663133402133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968, while the sum is 37.
Adding to 2663133402133 its reverse (3312043313662), we get a palindrome (5975176715795).
The spelling of 2663133402133 in words is "two trillion, six hundred sixty-three billion, one hundred thirty-three million, four hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •