Base | Representation |
---|---|
bin | 10111001101011011010100… |
… | …100010011110011100001101 |
3 | 111101102112112111121201020122 |
4 | 113031123110202132130031 |
5 | 101334420222143022414 |
6 | 1001033512551354325 |
7 | 30333606005424356 |
oct | 2715332442363415 |
9 | 441375474551218 |
10 | 102077758564109 |
11 | 2a585a30603089 |
12 | b54742a9829a5 |
13 | 44c5b783334a3 |
14 | 1b2c838894d2d |
15 | bc04240b6b8e |
hex | 5cd6d489e70d |
102077758564109 has 2 divisors, whose sum is σ = 102077758564110. Its totient is φ = 102077758564108.
The previous prime is 102077758564099. The next prime is 102077758564121. The reversal of 102077758564109 is 901465857770201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100612334524900 + 1465424039209 = 10030570^2 + 1210547^2 .
It is an emirp because it is prime and its reverse (901465857770201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102077758564109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102077758594109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51038879282054 + 51038879282055.
It is an arithmetic number, because the mean of its divisors is an integer number (51038879282055).
Almost surely, 2102077758564109 is an apocalyptic number.
It is an amenable number.
102077758564109 is a deficient number, since it is larger than the sum of its proper divisors (1).
102077758564109 is an equidigital number, since it uses as much as digits as its factorization.
102077758564109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29635200, while the sum is 62.
The spelling of 102077758564109 in words is "one hundred two trillion, seventy-seven billion, seven hundred fifty-eight million, five hundred sixty-four thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •