Base | Representation |
---|---|
bin | 10111001101110001111001… |
… | …011100101011010100010111 |
3 | 111101111212002221101101212011 |
4 | 113031301321130223110113 |
5 | 101340314344012333421 |
6 | 1001053002240205051 |
7 | 30335424513313564 |
oct | 2715617134532427 |
9 | 441455087341764 |
10 | 102102000121111 |
11 | 2a595240302711 |
12 | b550075309787 |
13 | 44c823c6a7263 |
14 | 1b2da9820d86b |
15 | bc0d923c04e1 |
hex | 5cdc7972b517 |
102102000121111 has 2 divisors, whose sum is σ = 102102000121112. Its totient is φ = 102102000121110.
The previous prime is 102102000121097. The next prime is 102102000121129. The reversal of 102102000121111 is 111121000201201.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102102000121111 - 29 = 102102000120599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102102000121091 and 102102000121100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102102000121181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51051000060555 + 51051000060556.
It is an arithmetic number, because the mean of its divisors is an integer number (51051000060556).
Almost surely, 2102102000121111 is an apocalyptic number.
102102000121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102102000121111 is an equidigital number, since it uses as much as digits as its factorization.
102102000121111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102102000121111 its reverse (111121000201201), we get a palindrome (213223000322312).
The spelling of 102102000121111 in words is "one hundred two trillion, one hundred two billion, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •