Base | Representation |
---|---|
bin | 1010000001100001001011… |
… | …0101111001110110010001 |
3 | 1110000121122112100010200012 |
4 | 2200120102311321312101 |
5 | 2421032410230431001 |
6 | 35235023112204305 |
7 | 2215153444006325 |
oct | 240302265716621 |
9 | 43017575303605 |
10 | 11021202202001 |
11 | 356a07a359102 |
12 | 129bb96399695 |
13 | 61c3aabb4504 |
14 | 2a16013a1985 |
15 | 141a47c482bb |
hex | a0612d79d91 |
11021202202001 has 2 divisors, whose sum is σ = 11021202202002. Its totient is φ = 11021202202000.
The previous prime is 11021202201983. The next prime is 11021202202019. The reversal of 11021202202001 is 10020220212011.
It is a balanced prime because it is at equal distance from previous prime (11021202201983) and next prime (11021202202019).
It can be written as a sum of positive squares in only one way, i.e., 7897499442001 + 3123702760000 = 2810249^2 + 1767400^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021202202001 - 222 = 11021198007697 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11021202202061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510601101000 + 5510601101001.
It is an arithmetic number, because the mean of its divisors is an integer number (5510601101001).
Almost surely, 211021202202001 is an apocalyptic number.
It is an amenable number.
11021202202001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021202202001 is an equidigital number, since it uses as much as digits as its factorization.
11021202202001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11021202202001 its reverse (10020220212011), we get a palindrome (21041422414012).
The spelling of 11021202202001 in words is "eleven trillion, twenty-one billion, two hundred two million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •