Base | Representation |
---|---|
bin | 1010001011111111101110… |
… | …1011000001011100110101 |
3 | 1110122211021000220101000211 |
4 | 2202333323223001130311 |
5 | 2432010030214200041 |
6 | 35453432230505421 |
7 | 2234155141623163 |
oct | 242777353013465 |
9 | 43584230811024 |
10 | 11201202100021 |
11 | 36294486306aa |
12 | 130aa4bb05271 |
13 | 6333657c14cb |
14 | 2aa1d9172233 |
15 | 146580431481 |
hex | a2ffbac1735 |
11201202100021 has 2 divisors, whose sum is σ = 11201202100022. Its totient is φ = 11201202100020.
The previous prime is 11201202099959. The next prime is 11201202100163. The reversal of 11201202100021 is 12000120210211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8871396723121 + 2329805376900 = 2978489^2 + 1526370^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201202100021 - 229 = 11200665229109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201202099974 and 11201202100010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201202190021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600601050010 + 5600601050011.
It is an arithmetic number, because the mean of its divisors is an integer number (5600601050011).
Almost surely, 211201202100021 is an apocalyptic number.
It is an amenable number.
11201202100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201202100021 is an equidigital number, since it uses as much as digits as its factorization.
11201202100021 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 11201202100021 its reverse (12000120210211), we get a palindrome (23201322310232).
The spelling of 11201202100021 in words is "eleven trillion, two hundred one billion, two hundred two million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •