Base | Representation |
---|---|
bin | 110010000001100101010011… |
… | …100101010000001001100001 |
3 | 1001211222212002222111012121211 |
4 | 302001211103211100021201 |
5 | 212314130214103341001 |
6 | 2055531412134150121 |
7 | 64225164131024356 |
oct | 6201452345201141 |
9 | 1054885088435554 |
10 | 220011102012001 |
11 | 64114203454313 |
12 | 20813760ab2341 |
13 | 959bc5b666791 |
14 | 3c4884650862d |
15 | 1a67ed8915351 |
hex | c81953950261 |
220011102012001 has 2 divisors, whose sum is σ = 220011102012002. Its totient is φ = 220011102012000.
The previous prime is 220011102011969. The next prime is 220011102012011. The reversal of 220011102012001 is 100210201110022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 179126075672401 + 40885026339600 = 13383799^2 + 6394140^2 .
It is a cyclic number.
It is not a de Polignac number, because 220011102012001 - 25 = 220011102011969 is a prime.
It is a super-2 number, since 2×2200111020120012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (220011102012011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110005551006000 + 110005551006001.
It is an arithmetic number, because the mean of its divisors is an integer number (110005551006001).
Almost surely, 2220011102012001 is an apocalyptic number.
It is an amenable number.
220011102012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
220011102012001 is an equidigital number, since it uses as much as digits as its factorization.
220011102012001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220011102012001 its reverse (100210201110022), we get a palindrome (320221303122023).
The spelling of 220011102012001 in words is "two hundred twenty trillion, eleven billion, one hundred two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •