Base | Representation |
---|---|
bin | 1001101001100101100010… |
… | …01100010000101100001001 |
3 | 2210010121211000222121221002 |
4 | 10310302301030100230021 |
5 | 10240132241433123221 |
6 | 113044215020024345 |
7 | 4320050065220525 |
oct | 464626114205411 |
9 | 83117730877832 |
10 | 21220111223561 |
11 | 6841442640048 |
12 | 24687243920b5 |
13 | bac081319613 |
14 | 5350b7740d85 |
15 | 26beb545c80b |
hex | 134cb1310b09 |
21220111223561 has 2 divisors, whose sum is σ = 21220111223562. Its totient is φ = 21220111223560.
The previous prime is 21220111223537. The next prime is 21220111223573. The reversal of 21220111223561 is 16532211102212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11265045046336 + 9955066177225 = 3356344^2 + 3155165^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220111223561 - 234 = 21202931354377 is a prime.
It is a super-3 number, since 3×212201112235613 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (21220111223581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610055611780 + 10610055611781.
It is an arithmetic number, because the mean of its divisors is an integer number (10610055611781).
Almost surely, 221220111223561 is an apocalyptic number.
It is an amenable number.
21220111223561 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220111223561 is an equidigital number, since it uses as much as digits as its factorization.
21220111223561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 21220111223561 its reverse (16532211102212), we get a palindrome (37752322325773).
The spelling of 21220111223561 in words is "twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •