Base | Representation |
---|---|
bin | 1010000011100001010100… |
… | …01110111110110011011001 |
3 | 2220021210212120010022210012 |
4 | 11001300222032332303121 |
5 | 10344232214223211022 |
6 | 115005424541331305 |
7 | 4441324103512223 |
oct | 501605216766331 |
9 | 86253776108705 |
10 | 22111200210137 |
11 | 7055342098635 |
12 | 2591370266b35 |
13 | c451008b0ccc |
14 | 56628b477413 |
15 | 28526a4d8de2 |
hex | 141c2a3becd9 |
22111200210137 has 2 divisors, whose sum is σ = 22111200210138. Its totient is φ = 22111200210136.
The previous prime is 22111200210037. The next prime is 22111200210167. The reversal of 22111200210137 is 73101200211122.
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., 19482080650201 + 2629119559936 = 4413851^2 + 1621456^2 .
It is a cyclic number.
It is not a de Polignac number, because 22111200210137 - 28 = 22111200209881 is a prime.
It is not a weakly prime, because it can be changed into another prime (22111200210167) 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, 11055600105068 + 11055600105069.
It is an arithmetic number, because the mean of its divisors is an integer number (11055600105069).
Almost surely, 222111200210137 is an apocalyptic number.
It is an amenable number.
22111200210137 is a deficient number, since it is larger than the sum of its proper divisors (1).
22111200210137 is an equidigital number, since it uses as much as digits as its factorization.
22111200210137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 22111200210137 its reverse (73101200211122), we get a palindrome (95212400421259).
The spelling of 22111200210137 in words is "twenty-two trillion, one hundred eleven billion, two hundred million, two hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •