Base | Representation |
---|---|
bin | 1010000011011111011101… |
… | …01000010100100111101001 |
3 | 2220021201021212110120101112 |
4 | 11001233232220110213221 |
5 | 10344223142224021022 |
6 | 115005141420200105 |
7 | 4441260241652411 |
oct | 501575650244751 |
9 | 86251255416345 |
10 | 22110200220137 |
11 | 7054979681317 |
12 | 2591131399035 |
13 | c44ca1678553 |
14 | 5661d472d641 |
15 | 28520c80a8e2 |
hex | 141beea149e9 |
22110200220137 has 2 divisors, whose sum is σ = 22110200220138. Its totient is φ = 22110200220136.
The previous prime is 22110200220079. The next prime is 22110200220149. The reversal of 22110200220137 is 73102200201122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19755144744976 + 2355055475161 = 4444676^2 + 1534619^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22110200220137 is a prime.
It is not a weakly prime, because it can be changed into another prime (22110200250137) 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, 11055100110068 + 11055100110069.
It is an arithmetic number, because the mean of its divisors is an integer number (11055100110069).
Almost surely, 222110200220137 is an apocalyptic number.
It is an amenable number.
22110200220137 is a deficient number, since it is larger than the sum of its proper divisors (1).
22110200220137 is an equidigital number, since it uses as much as digits as its factorization.
22110200220137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 22110200220137 its reverse (73102200201122), we get a palindrome (95212400421259).
The spelling of 22110200220137 in words is "twenty-two trillion, one hundred ten billion, two hundred million, two hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •