Base | Representation |
---|---|
bin | 10111001110000110100101… |
… | …011101010010001001000001 |
3 | 111101120222110000102112011002 |
4 | 113032012211131102021001 |
5 | 101341200342102022423 |
6 | 1001111114350101345 |
7 | 30340142131325324 |
oct | 2716064535221101 |
9 | 441528400375132 |
10 | 102124213314113 |
11 | 2a5a36aa052361 |
12 | b5544344aa855 |
13 | 44ca36c752543 |
14 | 1b30ba44087bb |
15 | bc17425b2228 |
hex | 5ce1a5752241 |
102124213314113 has 2 divisors, whose sum is σ = 102124213314114. Its totient is φ = 102124213314112.
The previous prime is 102124213314091. The next prime is 102124213314161. The reversal of 102124213314113 is 311413312421201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90639387102784 + 11484826211329 = 9520472^2 + 3388927^2 .
It is a cyclic number.
It is not a de Polignac number, because 102124213314113 - 222 = 102124209119809 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (102124213314313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51062106657056 + 51062106657057.
It is an arithmetic number, because the mean of its divisors is an integer number (51062106657057).
Almost surely, 2102124213314113 is an apocalyptic number.
It is an amenable number.
102124213314113 is a deficient number, since it is larger than the sum of its proper divisors (1).
102124213314113 is an equidigital number, since it uses as much as digits as its factorization.
102124213314113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 102124213314113 its reverse (311413312421201), we get a palindrome (413537525735314).
The spelling of 102124213314113 in words is "one hundred two trillion, one hundred twenty-four billion, two hundred thirteen million, three hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •