Base | Representation |
---|---|
bin | 1010001100000011000101… |
… | …0100101101100110100101 |
3 | 1110122220120202122021012001 |
4 | 2203000301110231212211 |
5 | 2432013401132034341 |
6 | 35454101423325301 |
7 | 2234216351545222 |
oct | 243006124554645 |
9 | 43586522567161 |
10 | 11202102221221 |
11 | 362986a73601a |
12 | 130b061450831 |
13 | 63347a12b0c2 |
14 | 2aa282920949 |
15 | 1465d4483d31 |
hex | a303152d9a5 |
11202102221221 has 2 divisors, whose sum is σ = 11202102221222. Its totient is φ = 11202102221220.
The previous prime is 11202102221213. The next prime is 11202102221251. The reversal of 11202102221221 is 12212220120211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7694460184321 + 3507642036900 = 2773889^2 + 1872870^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202102221221 - 23 = 11202102221213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202102221251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601051110610 + 5601051110611.
It is an arithmetic number, because the mean of its divisors is an integer number (5601051110611).
Almost surely, 211202102221221 is an apocalyptic number.
It is an amenable number.
11202102221221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202102221221 is an equidigital number, since it uses as much as digits as its factorization.
11202102221221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11202102221221 its reverse (12212220120211), we get a palindrome (23414322341432).
The spelling of 11202102221221 in words is "eleven trillion, two hundred two billion, one hundred two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •