Base | Representation |
---|---|
bin | 1001101001000000011110… |
… | …00011110001101010010101 |
3 | 2210001201110011121202120102 |
4 | 10310200033003301222111 |
5 | 10234321013033034031 |
6 | 113031124221543445 |
7 | 4315443666046001 |
oct | 464401703615225 |
9 | 83051404552512 |
10 | 21200211221141 |
11 | 6833a60600757 |
12 | 24648aba14b85 |
13 | baa22c584364 |
14 | 53414a849701 |
15 | 26b6ed3957cb |
hex | 13480f0f1a95 |
21200211221141 has 2 divisors, whose sum is σ = 21200211221142. Its totient is φ = 21200211221140.
The previous prime is 21200211221081. The next prime is 21200211221143. The reversal of 21200211221141 is 14112211200212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11370073778116 + 9830137443025 = 3371954^2 + 3135305^2 .
It is a cyclic number.
It is not a de Polignac number, because 21200211221141 - 234 = 21183031351957 is a prime.
Together with 21200211221143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200211221143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600105610570 + 10600105610571.
It is an arithmetic number, because the mean of its divisors is an integer number (10600105610571).
Almost surely, 221200211221141 is an apocalyptic number.
It is an amenable number.
21200211221141 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200211221141 is an equidigital number, since it uses as much as digits as its factorization.
21200211221141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 21200211221141 its reverse (14112211200212), we get a palindrome (35312422421353).
The spelling of 21200211221141 in words is "twenty-one trillion, two hundred billion, two hundred eleven million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •