Base | Representation |
---|---|
bin | 1010001011111111110000… |
… | …1001100011000100000101 |
3 | 1110122211021120221220201012 |
4 | 2202333330021203010011 |
5 | 2432010034241231041 |
6 | 35453433114212005 |
7 | 2234155266631502 |
oct | 242777411430405 |
9 | 43584246856635 |
10 | 11201210102021 |
11 | 36294520a6725 |
12 | 130aa52724005 |
13 | 633367363814 |
14 | 2aa1da2564a9 |
15 | 146580eb23eb |
hex | a2ffc263105 |
11201210102021 has 2 divisors, whose sum is σ = 11201210102022. Its totient is φ = 11201210102020.
The previous prime is 11201210101969. The next prime is 11201210102039. The reversal of 11201210102021 is 12020101210211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6482370602500 + 4718839499521 = 2546050^2 + 2172289^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201210102021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201210101987 and 11201210102005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201210108021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600605051010 + 5600605051011.
It is an arithmetic number, because the mean of its divisors is an integer number (5600605051011).
Almost surely, 211201210102021 is an apocalyptic number.
It is an amenable number.
11201210102021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201210102021 is an equidigital number, since it uses as much as digits as its factorization.
11201210102021 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 11201210102021 its reverse (12020101210211), we get a palindrome (23221311312232).
The spelling of 11201210102021 in words is "eleven trillion, two hundred one billion, two hundred ten million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •