Base | Representation |
---|---|
bin | 101111100110011011… |
… | …0100101111101001101 |
3 | 100202211222001110220102 |
4 | 1133030312211331031 |
5 | 3133322101023432 |
6 | 114543145100445 |
7 | 10246064052056 |
oct | 1371466457515 |
9 | 322758043812 |
10 | 102221111117 |
11 | 3a396174824 |
12 | 17989787725 |
13 | 9840a23188 |
14 | 4d3a03572d |
15 | 29d4226962 |
hex | 17ccda5f4d |
102221111117 has 2 divisors, whose sum is σ = 102221111118. Its totient is φ = 102221111116.
The previous prime is 102221111081. The next prime is 102221111119. The reversal of 102221111117 is 711111122201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70412745316 + 31808365801 = 265354^2 + 178349^2 .
It is a cyclic number.
It is not a de Polignac number, because 102221111117 - 26 = 102221111053 is a prime.
Together with 102221111119, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102221111119) 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, 51110555558 + 51110555559.
It is an arithmetic number, because the mean of its divisors is an integer number (51110555559).
Almost surely, 2102221111117 is an apocalyptic number.
It is an amenable number.
102221111117 is a deficient number, since it is larger than the sum of its proper divisors (1).
102221111117 is an equidigital number, since it uses as much as digits as its factorization.
102221111117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 102221111117 its reverse (711111122201), we get a palindrome (813332233318).
The spelling of 102221111117 in words is "one hundred two billion, two hundred twenty-one million, one hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •