Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …1001100010101010100001 |
3 | 1110122211001110012212220011 |
4 | 2202333312321202222201 |
5 | 2432004344214120001 |
6 | 35453420250244521 |
7 | 2234153150144554 |
oct | 242776671425241 |
9 | 43584043185804 |
10 | 11201122020001 |
11 | 3629407405371 |
12 | 130aa29126741 |
13 | 633352033894 |
14 | 2aa1cc68869b |
15 | 1465783b3d51 |
hex | a2ff6e62aa1 |
11201122020001 has 2 divisors, whose sum is σ = 11201122020002. Its totient is φ = 11201122020000.
The previous prime is 11201122019999. The next prime is 11201122020007. The reversal of 11201122020001 is 10002022110211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10569319600401 + 631802419600 = 3251049^2 + 794860^2 .
It is an emirp because it is prime and its reverse (10002022110211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11201122020001 - 21 = 11201122019999 is a prime.
Together with 11201122019999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11201122020007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600561010000 + 5600561010001.
It is an arithmetic number, because the mean of its divisors is an integer number (5600561010001).
Almost surely, 211201122020001 is an apocalyptic number.
It is an amenable number.
11201122020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201122020001 is an equidigital number, since it uses as much as digits as its factorization.
11201122020001 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 11201122020001 its reverse (10002022110211), we get a palindrome (21203144130212).
The spelling of 11201122020001 in words is "eleven trillion, two hundred one billion, one hundred twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •