Base | Representation |
---|---|
bin | 1100111011110000101… |
… | …0000111110011111101 |
3 | 210020112111200201111122 |
4 | 3032330022013303331 |
5 | 12120031211232031 |
6 | 250024411200325 |
7 | 22024216463603 |
oct | 3167412076375 |
9 | 706474621448 |
10 | 222200102141 |
11 | 8626418a556 |
12 | 370924460a5 |
13 | 17c51762aa4 |
14 | aa7c66d873 |
15 | 5ba742c47b |
hex | 33bc287cfd |
222200102141 has 2 divisors, whose sum is σ = 222200102142. Its totient is φ = 222200102140.
The previous prime is 222200102107. The next prime is 222200102143. The reversal of 222200102141 is 141201002222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124024413241 + 98175688900 = 352171^2 + 313330^2 .
It is a cyclic number.
It is not a de Polignac number, because 222200102141 - 26 = 222200102077 is a prime.
Together with 222200102143, 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 (222200102143) 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, 111100051070 + 111100051071.
It is an arithmetic number, because the mean of its divisors is an integer number (111100051071).
Almost surely, 2222200102141 is an apocalyptic number.
It is an amenable number.
222200102141 is a deficient number, since it is larger than the sum of its proper divisors (1).
222200102141 is an equidigital number, since it uses as much as digits as its factorization.
222200102141 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 17.
Adding to 222200102141 its reverse (141201002222), we get a palindrome (363401104363).
The spelling of 222200102141 in words is "two hundred twenty-two billion, two hundred million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •