Base | Representation |
---|---|
bin | 1001101100101001011000… |
… | …1110000001110101100101 |
3 | 1101202100002221202122122011 |
4 | 2123022112032001311211 |
5 | 2344144031021313423 |
6 | 34402202202034221 |
7 | 2150230613562355 |
oct | 233122616016545 |
9 | 41670087678564 |
10 | 10662629088613 |
11 | 3440aa5167887 |
12 | 12425a4aa8971 |
13 | 5c463512c038 |
14 | 28c1070bab65 |
15 | 13755d23cb0d |
hex | 9b296381d65 |
10662629088613 has 2 divisors, whose sum is σ = 10662629088614. Its totient is φ = 10662629088612.
The previous prime is 10662629088569. The next prime is 10662629088637. The reversal of 10662629088613 is 31688092626601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5426211512929 + 5236417575684 = 2329423^2 + 2288322^2 .
It is an emirp because it is prime and its reverse (31688092626601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10662629088613 - 233 = 10654039154021 is a prime.
It is a super-2 number, since 2×106626290886132 (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 (10662629088913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5331314544306 + 5331314544307.
It is an arithmetic number, because the mean of its divisors is an integer number (5331314544307).
Almost surely, 210662629088613 is an apocalyptic number.
It is an amenable number.
10662629088613 is a deficient number, since it is larger than the sum of its proper divisors (1).
10662629088613 is an equidigital number, since it uses as much as digits as its factorization.
10662629088613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8957952, while the sum is 58.
The spelling of 10662629088613 in words is "ten trillion, six hundred sixty-two billion, six hundred twenty-nine million, eighty-eight thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •