Base | Representation |
---|---|
bin | 1010000011100010110101… |
… | …00100101111100000011001 |
3 | 2220021212222002011221120012 |
4 | 11001301122210233200121 |
5 | 10344240344333033032 |
6 | 115010041232211305 |
7 | 4441353152135354 |
oct | 501613244574031 |
9 | 86255862157505 |
10 | 22112011221017 |
11 | 705571896a063 |
12 | 2591557999b35 |
13 | c451cc91a8c3 |
14 | 56632706b29b |
15 | 2852b67d86b2 |
hex | 141c5a92f819 |
22112011221017 has 2 divisors, whose sum is σ = 22112011221018. Its totient is φ = 22112011221016.
The previous prime is 22112011220951. The next prime is 22112011221029. The reversal of 22112011221017 is 71012211021122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16763980339456 + 5348030881561 = 4094384^2 + 2312581^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22112011221017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22112011220983 and 22112011221001.
It is not a weakly prime, because it can be changed into another prime (22112011121017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11056005610508 + 11056005610509.
It is an arithmetic number, because the mean of its divisors is an integer number (11056005610509).
Almost surely, 222112011221017 is an apocalyptic number.
It is an amenable number.
22112011221017 is a deficient number, since it is larger than the sum of its proper divisors (1).
22112011221017 is an equidigital number, since it uses as much as digits as its factorization.
22112011221017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 22112011221017 its reverse (71012211021122), we get a palindrome (93124222242139).
The spelling of 22112011221017 in words is "twenty-two trillion, one hundred twelve billion, eleven million, two hundred twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •