Base | Representation |
---|---|
bin | 101111100110011001… |
… | …0110110101111110001 |
3 | 100202211220012200212101 |
4 | 1133030302312233301 |
5 | 3133321323200223 |
6 | 114543112100401 |
7 | 10246052531356 |
oct | 1371462665761 |
9 | 322756180771 |
10 | 102220131313 |
11 | 3a395665673 |
12 | 17989394701 |
13 | 984076c201 |
14 | 4d39c5c62d |
15 | 29d40d14ad |
hex | 17cccb6bf1 |
102220131313 has 2 divisors, whose sum is σ = 102220131314. Its totient is φ = 102220131312.
The previous prime is 102220131241. The next prime is 102220131331. The reversal of 102220131313 is 313131022201.
Together with next prime (102220131331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61733862369 + 40486268944 = 248463^2 + 201212^2 .
It is a cyclic number.
It is not a de Polignac number, because 102220131313 - 217 = 102220000241 is a prime.
It is not a weakly prime, because it can be changed into another prime (102220131413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110065656 + 51110065657.
It is an arithmetic number, because the mean of its divisors is an integer number (51110065657).
Almost surely, 2102220131313 is an apocalyptic number.
It is an amenable number.
102220131313 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220131313 is an equidigital number, since it uses as much as digits as its factorization.
102220131313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 102220131313 its reverse (313131022201), we get a palindrome (415351153514).
The spelling of 102220131313 in words is "one hundred two billion, two hundred twenty million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •