Base | Representation |
---|---|
bin | 110010100001011011111110… |
… | …001010010111010110011101 |
3 | 1002010202010022011120110211111 |
4 | 302201123332022113112131 |
5 | 213111011302132034323 |
6 | 2104325152345422021 |
7 | 64542266446554514 |
oct | 6241337612272635 |
9 | 1063663264513744 |
10 | 222200102221213 |
11 | 64888596a60706 |
12 | 20b07a5079a911 |
13 | 96ca4c236696c |
14 | 3cc278422167b |
15 | 1aa4e04319c0d |
hex | ca16fe29759d |
222200102221213 has 2 divisors, whose sum is σ = 222200102221214. Its totient is φ = 222200102221212.
The previous prime is 222200102221177. The next prime is 222200102221247. The reversal of 222200102221213 is 312122201002222.
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., 194762064895524 + 27438037325689 = 13955718^2 + 5238133^2 .
It is a cyclic number.
It is not a de Polignac number, because 222200102221213 - 213 = 222200102213021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222200102221813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111100051110606 + 111100051110607.
It is an arithmetic number, because the mean of its divisors is an integer number (111100051110607).
Almost surely, 2222200102221213 is an apocalyptic number.
It is an amenable number.
222200102221213 is a deficient number, since it is larger than the sum of its proper divisors (1).
222200102221213 is an equidigital number, since it uses as much as digits as its factorization.
222200102221213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 222200102221213 its reverse (312122201002222), we get a palindrome (534322303223435).
The spelling of 222200102221213 in words is "two hundred twenty-two trillion, two hundred billion, one hundred two million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •