Base | Representation |
---|---|
bin | 1010000011011111011110… |
… | …10001110111010100001101 |
3 | 2220021201022121221211200121 |
4 | 11001233233101313110031 |
5 | 10344223203021011112 |
6 | 115005142445424541 |
7 | 4441260433346632 |
oct | 501575721672415 |
9 | 86251277854617 |
10 | 22110211110157 |
11 | 705498483a135 |
12 | 2591134b6b151 |
13 | c44ca39bc251 |
14 | 5661d5d66189 |
15 | 28520d75c407 |
hex | 141bef47750d |
22110211110157 has 2 divisors, whose sum is σ = 22110211110158. Its totient is φ = 22110211110156.
The previous prime is 22110211110049. The next prime is 22110211110173. The reversal of 22110211110157 is 75101111201122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19093281811396 + 3016929298761 = 4369586^2 + 1736931^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22110211110157 is a prime.
It is a super-2 number, since 2×221102111101572 (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 (22110211110557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11055105555078 + 11055105555079.
It is an arithmetic number, because the mean of its divisors is an integer number (11055105555079).
Almost surely, 222110211110157 is an apocalyptic number.
It is an amenable number.
22110211110157 is a deficient number, since it is larger than the sum of its proper divisors (1).
22110211110157 is an equidigital number, since it uses as much as digits as its factorization.
22110211110157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 25.
Adding to 22110211110157 its reverse (75101111201122), we get a palindrome (97211322311279).
The spelling of 22110211110157 in words is "twenty-two trillion, one hundred ten billion, two hundred eleven million, one hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •