Base | Representation |
---|---|
bin | 10111001111001111000011… |
… | …001010100001000001001001 |
3 | 111101212102021120112201002001 |
4 | 113033033003022201001021 |
5 | 101343434214401401441 |
6 | 1001210543233311001 |
7 | 30345565233640534 |
oct | 2717170312410111 |
9 | 441772246481061 |
10 | 102202021122121 |
11 | 2a6236a7582118 |
12 | b56752a105461 |
13 | 45047bc65a91b |
14 | 1b34865d79a1b |
15 | bc37983a7731 |
hex | 5cf3c32a1049 |
102202021122121 has 2 divisors, whose sum is σ = 102202021122122. Its totient is φ = 102202021122120.
The previous prime is 102202021122053. The next prime is 102202021122133. The reversal of 102202021122121 is 121221120202201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54700978712121 + 47501042410000 = 7396011^2 + 6892100^2 .
It is an emirp because it is prime and its reverse (121221120202201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102202021122121 is a prime.
It is not a weakly prime, because it can be changed into another prime (102202021122151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101010561060 + 51101010561061.
It is an arithmetic number, because the mean of its divisors is an integer number (51101010561061).
Almost surely, 2102202021122121 is an apocalyptic number.
It is an amenable number.
102202021122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202021122121 is an equidigital number, since it uses as much as digits as its factorization.
102202021122121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102202021122121 its reverse (121221120202201), we get a palindrome (223423141324322).
The spelling of 102202021122121 in words is "one hundred two trillion, two hundred two billion, twenty-one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •