Base | Representation |
---|---|
bin | 1010000011100001001000… |
… | …10001001000100011011101 |
3 | 2220021210121120202202200022 |
4 | 11001300210101020203131 |
5 | 10344232013112023234 |
6 | 115005411004041525 |
7 | 4441321446625214 |
oct | 501604421104335 |
9 | 86253546682608 |
10 | 22111100111069 |
11 | 70552a0639732 |
12 | 25913428332a5 |
13 | c450b5c343a8 |
14 | 56627c05c07b |
15 | 285261814e2e |
hex | 141c244488dd |
22111100111069 has 2 divisors, whose sum is σ = 22111100111070. Its totient is φ = 22111100111068.
The previous prime is 22111100111047. The next prime is 22111100111129. The reversal of 22111100111069 is 96011100111122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11998000498969 + 10113099612100 = 3463813^2 + 3180110^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22111100111069 is a prime.
It is a super-2 number, since 2×221111001110692 (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 (22111100111669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11055550055534 + 11055550055535.
It is an arithmetic number, because the mean of its divisors is an integer number (11055550055535).
Almost surely, 222111100111069 is an apocalyptic number.
It is an amenable number.
22111100111069 is a deficient number, since it is larger than the sum of its proper divisors (1).
22111100111069 is an equidigital number, since it uses as much as digits as its factorization.
22111100111069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 26.
The spelling of 22111100111069 in words is "twenty-two trillion, one hundred eleven billion, one hundred million, one hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •