Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …0101001001100010100001 |
3 | 1110000201021112210121120121 |
4 | 2200121033211021202201 |
5 | 2421042002113020001 |
6 | 35235312153240241 |
7 | 2215220626346305 |
oct | 240311745114241 |
9 | 43021245717517 |
10 | 11022221220001 |
11 | 356a552591442 |
12 | 12a021b703081 |
13 | 61c51104cb44 |
14 | 2a169a85dd05 |
15 | 141aa74346a1 |
hex | a064f9498a1 |
11022221220001 has 2 divisors, whose sum is σ = 11022221220002. Its totient is φ = 11022221220000.
The previous prime is 11022221219969. The next prime is 11022221220019. The reversal of 11022221220001 is 10002212222011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8569085290000 + 2453135930001 = 2927300^2 + 1566249^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022221220001 - 25 = 11022221219969 is a prime.
It is a super-3 number, since 3×110222212200013 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11022221229001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511110610000 + 5511110610001.
It is an arithmetic number, because the mean of its divisors is an integer number (5511110610001).
Almost surely, 211022221220001 is an apocalyptic number.
It is an amenable number.
11022221220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022221220001 is an equidigital number, since it uses as much as digits as its factorization.
11022221220001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11022221220001 its reverse (10002212222011), we get a palindrome (21024433442012).
The spelling of 11022221220001 in words is "eleven trillion, twenty-two billion, two hundred twenty-one million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •