Base | Representation |
---|---|
bin | 11110000101100001011011… |
… | …01110010111001110111101 |
3 | 22200020212200001102001002102 |
4 | 33002300231232113032331 |
5 | 32132433041444343333 |
6 | 352413404343234445 |
7 | 16635635314451312 |
oct | 1702605556271675 |
9 | 280225601361072 |
10 | 66160443356093 |
11 | 1a098539525709 |
12 | 7506406748a25 |
13 | 2abbb97c89788 |
14 | 124a27ac88d09 |
15 | 79aeb93a2ae8 |
hex | 3c2c2db973bd |
66160443356093 has 2 divisors, whose sum is σ = 66160443356094. Its totient is φ = 66160443356092.
The previous prime is 66160443356039. The next prime is 66160443356143. The reversal of 66160443356093 is 39065334406166.
It is a happy number.
Together with previous prime (66160443356039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59531069747044 + 6629373609049 = 7715638^2 + 2574757^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66160443356093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66160443356003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33080221678046 + 33080221678047.
It is an arithmetic number, because the mean of its divisors is an integer number (33080221678047).
Almost surely, 266160443356093 is an apocalyptic number.
It is an amenable number.
66160443356093 is a deficient number, since it is larger than the sum of its proper divisors (1).
66160443356093 is an equidigital number, since it uses as much as digits as its factorization.
66160443356093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25194240, while the sum is 56.
The spelling of 66160443356093 in words is "sixty-six trillion, one hundred sixty billion, four hundred forty-three million, three hundred fifty-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •