Base | Representation |
---|---|
bin | 10111001101110001111010… |
… | …001010000100110100101101 |
3 | 111101111212010202210000220002 |
4 | 113031301322022010310231 |
5 | 101340314410034201221 |
6 | 1001053003343234045 |
7 | 30335425016421332 |
oct | 2715617212046455 |
9 | 441455122700802 |
10 | 102102012022061 |
11 | 2a595246aa1007 |
12 | b5500792a8925 |
13 | 44c8241cb313c |
14 | 1b2da99a2a989 |
15 | bc0d9347180b |
hex | 5cdc7a284d2d |
102102012022061 has 2 divisors, whose sum is σ = 102102012022062. Its totient is φ = 102102012022060.
The previous prime is 102102012022057. The next prime is 102102012022121. The reversal of 102102012022061 is 160220210201201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56409562996900 + 45692449025161 = 7510630^2 + 6759619^2 .
It is an emirp because it is prime and its reverse (160220210201201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102102012022061 - 22 = 102102012022057 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102102012022001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51051006011030 + 51051006011031.
It is an arithmetic number, because the mean of its divisors is an integer number (51051006011031).
Almost surely, 2102102012022061 is an apocalyptic number.
It is an amenable number.
102102012022061 is a deficient number, since it is larger than the sum of its proper divisors (1).
102102012022061 is an equidigital number, since it uses as much as digits as its factorization.
102102012022061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102102012022061 its reverse (160220210201201), we get a palindrome (262322222223262).
The spelling of 102102012022061 in words is "one hundred two trillion, one hundred two billion, twelve million, twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •