Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111100101010001100000101 |
3 | 111101120120212010102112022122 |
4 | 113032002300330222030011 |
5 | 101341113441421334112 |
6 | 1001105155325535325 |
7 | 30336635360264153 |
oct | 2716026074521405 |
9 | 441516763375278 |
10 | 102120111121157 |
11 | 2a5a199450a048 |
12 | b55368a714545 |
13 | 44c9b6790012c |
14 | 1b308d56923d3 |
15 | bc15a23a2872 |
hex | 5ce0b0f2a305 |
102120111121157 has 2 divisors, whose sum is σ = 102120111121158. Its totient is φ = 102120111121156.
The previous prime is 102120111121129. The next prime is 102120111121243. The reversal of 102120111121157 is 751121111021201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94742852156836 + 7377258964321 = 9733594^2 + 2716111^2 .
It is a cyclic number.
It is not a de Polignac number, because 102120111121157 - 212 = 102120111117061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102120111121957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51060055560578 + 51060055560579.
It is an arithmetic number, because the mean of its divisors is an integer number (51060055560579).
Almost surely, 2102120111121157 is an apocalyptic number.
It is an amenable number.
102120111121157 is a deficient number, since it is larger than the sum of its proper divisors (1).
102120111121157 is an equidigital number, since it uses as much as digits as its factorization.
102120111121157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 26.
Adding to 102120111121157 its reverse (751121111021201), we get a palindrome (853241222142358).
The spelling of 102120111121157 in words is "one hundred two trillion, one hundred twenty billion, one hundred eleven million, one hundred twenty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •