Base | Representation |
---|---|
bin | 10000000001100101001… |
… | …111100111111010001101 |
3 | 10220021102020022102111222 |
4 | 100001211033213322031 |
5 | 121020234304102341 |
6 | 2201520004453125 |
7 | 142363005306134 |
oct | 20014517477215 |
9 | 3807366272458 |
10 | 1101210222221 |
11 | 39502550994a |
12 | 1595090aa1a5 |
13 | 7cac773b4b5 |
14 | 3b4280d891b |
15 | 1d9a1d5a44b |
hex | 100653e7e8d |
1101210222221 has 2 divisors, whose sum is σ = 1101210222222. Its totient is φ = 1101210222220.
The previous prime is 1101210222139. The next prime is 1101210222241. The reversal of 1101210222221 is 1222220121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 996774604996 + 104435617225 = 998386^2 + 323165^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101210222221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101210222221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101210222241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550605111110 + 550605111111.
It is an arithmetic number, because the mean of its divisors is an integer number (550605111111).
Almost surely, 21101210222221 is an apocalyptic number.
It is an amenable number.
1101210222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101210222221 is an equidigital number, since it uses as much as digits as its factorization.
1101210222221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1101210222221 its reverse (1222220121011), we get a palindrome (2323430343232).
The spelling of 1101210222221 in words is "one trillion, one hundred one billion, two hundred ten million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •