Base | Representation |
---|---|
bin | 11111000010101001001… |
… | …000101001011010101001 |
3 | 21112221000021212111120001 |
4 | 133002221020221122221 |
5 | 234422133144120423 |
6 | 4311541315103001 |
7 | 310054142455531 |
oct | 37025110513251 |
9 | 7487007774501 |
10 | 2133141395113 |
11 | 752729785623 |
12 | 2a55008a1a61 |
13 | 1262011c8781 |
14 | 7535d24a4c1 |
15 | 3a74ba14cad |
hex | 1f0a92296a9 |
2133141395113 has 2 divisors, whose sum is σ = 2133141395114. Its totient is φ = 2133141395112.
The previous prime is 2133141395101. The next prime is 2133141395131. The reversal of 2133141395113 is 3115931413312.
It is a happy number.
Together with next prime (2133141395131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1673949491344 + 459191903769 = 1293812^2 + 677637^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2133141395113 is a prime.
It is not a weakly prime, because it can be changed into another prime (2133141395153) 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, 1066570697556 + 1066570697557.
It is an arithmetic number, because the mean of its divisors is an integer number (1066570697557).
Almost surely, 22133141395113 is an apocalyptic number.
It is an amenable number.
2133141395113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2133141395113 is an equidigital number, since it uses as much as digits as its factorization.
2133141395113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 37.
The spelling of 2133141395113 in words is "two trillion, one hundred thirty-three billion, one hundred forty-one million, three hundred ninety-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •