Base | Representation |
---|---|
bin | 10111001101111111011101… |
… | …011100001011101100100101 |
3 | 111101120020200211021202002112 |
4 | 113031333131130023230211 |
5 | 101341034210012140302 |
6 | 1001103411245050405 |
7 | 30336451421421323 |
oct | 2715773534135445 |
9 | 441506624252075 |
10 | 102116562615077 |
11 | 2a5a043347199a |
12 | b552a5a256a05 |
13 | 44c97206ac3aa |
14 | 1b3067a2a8d13 |
15 | bc1445ab3552 |
hex | 5cdfdd70bb25 |
102116562615077 has 2 divisors, whose sum is σ = 102116562615078. Its totient is φ = 102116562615076.
The previous prime is 102116562615049. The next prime is 102116562615107. The reversal of 102116562615077 is 770516265611201.
It is a Cunningham number, because it is equal to 101052742+1.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102116562615076 + 1 = 10105274^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 102116562615077 - 28 = 102116562614821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102116562615007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51058281307538 + 51058281307539.
It is an arithmetic number, because the mean of its divisors is an integer number (51058281307539).
Almost surely, 2102116562615077 is an apocalyptic number.
It is an amenable number.
102116562615077 is a deficient number, since it is larger than the sum of its proper divisors (1).
102116562615077 is an equidigital number, since it uses as much as digits as its factorization.
102116562615077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1058400, while the sum is 50.
The spelling of 102116562615077 in words is "one hundred two trillion, one hundred sixteen billion, five hundred sixty-two million, six hundred fifteen thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •