Base | Representation |
---|---|
bin | 1001101100100001110101… |
… | …0100001000100110100101 |
3 | 1101202010212120220002112221 |
4 | 2123020131110020212211 |
5 | 2344130402231133203 |
6 | 34401225021312341 |
7 | 2150126423236561 |
oct | 233103524104645 |
9 | 41663776802487 |
10 | 10660600646053 |
11 | 3440154163976 |
12 | 12421197056b1 |
13 | 5c43a0b06877 |
14 | 28bd9393a6a1 |
15 | 13749010cabd |
hex | 9b21d5089a5 |
10660600646053 has 2 divisors, whose sum is σ = 10660600646054. Its totient is φ = 10660600646052.
The previous prime is 10660600645943. The next prime is 10660600646081. The reversal of 10660600646053 is 35064600606601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10199093734404 + 461506911649 = 3193602^2 + 679343^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10660600646053 is a prime.
It is a super-2 number, since 2×106606006460532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10660600946053) 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, 5330300323026 + 5330300323027.
It is an arithmetic number, because the mean of its divisors is an integer number (5330300323027).
Almost surely, 210660600646053 is an apocalyptic number.
It is an amenable number.
10660600646053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10660600646053 is an equidigital number, since it uses as much as digits as its factorization.
10660600646053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 43.
The spelling of 10660600646053 in words is "ten trillion, six hundred sixty billion, six hundred million, six hundred forty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •