Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1010101101110101110101 |
3 | 1102222122212220222120000112 |
4 | 2200032333322231311311 |
5 | 2420401440040120041 |
6 | 35230252440552405 |
7 | 2214351215241365 |
oct | 240167772556565 |
9 | 42878786876015 |
10 | 11011221020021 |
11 | 3565918227382 |
12 | 129a06b782705 |
13 | 61b47a085481 |
14 | 2a0d3593a9a5 |
15 | 141661855deb |
hex | a03bfeadd75 |
11011221020021 has 2 divisors, whose sum is σ = 11011221020022. Its totient is φ = 11011221020020.
The previous prime is 11011221019969. The next prime is 11011221020047. The reversal of 11011221020021 is 12002012211011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10965277240996 + 45943779025 = 3311386^2 + 214345^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011221020021 - 222 = 11011216825717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011221019978 and 11011221020005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011221020521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505610510010 + 5505610510011.
It is an arithmetic number, because the mean of its divisors is an integer number (5505610510011).
Almost surely, 211011221020021 is an apocalyptic number.
It is an amenable number.
11011221020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011221020021 is an equidigital number, since it uses as much as digits as its factorization.
11011221020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11011221020021 its reverse (12002012211011), we get a palindrome (23013233231032).
The spelling of 11011221020021 in words is "eleven trillion, eleven billion, two hundred twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •