Base | Representation |
---|---|
bin | 10111001111011111110100… |
… | …000110110011010000000101 |
3 | 111101221010202002120011212101 |
4 | 113033133310012303100011 |
5 | 101344233101124212442 |
6 | 1001223121352552101 |
7 | 30350103303510523 |
oct | 2717376406632005 |
9 | 441833662504771 |
10 | 102220022100997 |
11 | 2a6302a4672a69 |
12 | b56ab126b2631 |
13 | 45063cab41908 |
14 | 1b3569297d313 |
15 | bc3e9d8a5cb7 |
hex | 5cf7f41b3405 |
102220022100997 has 2 divisors, whose sum is σ = 102220022100998. Its totient is φ = 102220022100996.
The previous prime is 102220022100979. The next prime is 102220022101033. The reversal of 102220022100997 is 799001220022201.
Together with previous prime (102220022100979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70486922131201 + 31733099969796 = 8395649^2 + 5633214^2 .
It is a cyclic number.
It is not a de Polignac number, because 102220022100997 - 211 = 102220022098949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102220022100197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110011050498 + 51110011050499.
It is an arithmetic number, because the mean of its divisors is an integer number (51110011050499).
Almost surely, 2102220022100997 is an apocalyptic number.
It is an amenable number.
102220022100997 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220022100997 is an equidigital number, since it uses as much as digits as its factorization.
102220022100997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 102220022100997 in words is "one hundred two trillion, two hundred twenty billion, twenty-two million, one hundred thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •