Base | Representation |
---|---|
bin | 1010000000101000101110… |
… | …11101111000011010011001 |
3 | 2212221100002011122222202111 |
4 | 11000110113131320122121 |
5 | 10341121240340214314 |
6 | 114452115235432321 |
7 | 4431215246133262 |
oct | 500242735703231 |
9 | 85840064588674 |
10 | 22012101101209 |
11 | 701730924330a |
12 | 25761141556a1 |
13 | c3896991a70b |
14 | 561569d25969 |
15 | 2828ba404ec4 |
hex | 140517778699 |
22012101101209 has 2 divisors, whose sum is σ = 22012101101210. Its totient is φ = 22012101101208.
The previous prime is 22012101101191. The next prime is 22012101101219. The reversal of 22012101101209 is 90210110121022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19695373574809 + 2316727526400 = 4437947^2 + 1522080^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012101101209 - 221 = 22012099004057 is a prime.
It is a super-2 number, since 2×220121011012092 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22012101101209.
It is not a weakly prime, because it can be changed into another prime (22012101101219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006050550604 + 11006050550605.
It is an arithmetic number, because the mean of its divisors is an integer number (11006050550605).
Almost surely, 222012101101209 is an apocalyptic number.
It is an amenable number.
22012101101209 is a deficient number, since it is larger than the sum of its proper divisors (1).
22012101101209 is an equidigital number, since it uses as much as digits as its factorization.
22012101101209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 22012101101209 in words is "twenty-two trillion, twelve billion, one hundred one million, one hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •