Base | Representation |
---|---|
bin | 100101111001000111100010… |
… | …110000111101000110101101 |
3 | 210212001212002022001221211221 |
4 | 211321013202300331012231 |
5 | 133320414444104123414 |
6 | 1350235130424143341 |
7 | 50050161332611621 |
oct | 4571074260750655 |
9 | 725055068057757 |
10 | 166652830536109 |
11 | 49112083230a15 |
12 | 16836527907b51 |
13 | 71cb3a9cb0678 |
14 | 2d2207bc01181 |
15 | 144005128a224 |
hex | 9791e2c3d1ad |
166652830536109 has 2 divisors, whose sum is σ = 166652830536110. Its totient is φ = 166652830536108.
The previous prime is 166652830536091. The next prime is 166652830536197. The reversal of 166652830536109 is 901635038256661.
Together with previous prime (166652830536091) 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., 135906049515625 + 30746781020484 = 11657875^2 + 5544978^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-166652830536109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (166652830536509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83326415268054 + 83326415268055.
It is an arithmetic number, because the mean of its divisors is an integer number (83326415268055).
Almost surely, 2166652830536109 is an apocalyptic number.
It is an amenable number.
166652830536109 is a deficient number, since it is larger than the sum of its proper divisors (1).
166652830536109 is an equidigital number, since it uses as much as digits as its factorization.
166652830536109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41990400, while the sum is 61.
The spelling of 166652830536109 in words is "one hundred sixty-six trillion, six hundred fifty-two billion, eight hundred thirty million, five hundred thirty-six thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •