Base | Representation |
---|---|
bin | 1010000110011001101110… |
… | …01101100110100001001101 |
3 | 2220122021102011211111200201 |
4 | 11003030313031212201031 |
5 | 10402342443230401031 |
6 | 115123120453453501 |
7 | 4451430341525464 |
oct | 503146715464115 |
9 | 86567364744621 |
10 | 22210202200141 |
11 | 7093326139a8a |
12 | 25a859b941291 |
13 | c5154a6cc297 |
14 | 56ad9db479db |
15 | 287b11cd6d61 |
hex | 14333736684d |
22210202200141 has 2 divisors, whose sum is σ = 22210202200142. Its totient is φ = 22210202200140.
The previous prime is 22210202200033. The next prime is 22210202200169. The reversal of 22210202200141 is 14100220201222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15221343314116 + 6988858886025 = 3901454^2 + 2643645^2 .
It is a cyclic number.
It is not a de Polignac number, because 22210202200141 - 29 = 22210202199629 is a prime.
It is a super-2 number, since 2×222102022001412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22210202203141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105101100070 + 11105101100071.
It is an arithmetic number, because the mean of its divisors is an integer number (11105101100071).
Almost surely, 222210202200141 is an apocalyptic number.
It is an amenable number.
22210202200141 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210202200141 is an equidigital number, since it uses as much as digits as its factorization.
22210202200141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22210202200141 its reverse (14100220201222), we get a palindrome (36310422401363).
The spelling of 22210202200141 in words is "twenty-two trillion, two hundred ten billion, two hundred two million, two hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •