Base | Representation |
---|---|
bin | 110010010000000111100110… |
… | …101010110001000111111011 |
3 | 1001222112100110001021101120221 |
4 | 302100013212222301013323 |
5 | 212432011441020334321 |
6 | 2102014332054200511 |
7 | 64360305611613622 |
oct | 6220074652610773 |
9 | 1058470401241527 |
10 | 221010002121211 |
11 | 644698a7529a56 |
12 | 20955276653137 |
13 | 96421ccabc264 |
14 | 3c80d268406b9 |
15 | 1a83e9d817e41 |
hex | c901e6ab11fb |
221010002121211 has 2 divisors, whose sum is σ = 221010002121212. Its totient is φ = 221010002121210.
The previous prime is 221010002121199. The next prime is 221010002121221. The reversal of 221010002121211 is 112121200010122.
221010002121211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 221010002121211 - 233 = 221001412186619 is a prime.
It is a super-2 number, since 2×2210100021212112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221010002121221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110505001060605 + 110505001060606.
It is an arithmetic number, because the mean of its divisors is an integer number (110505001060606).
Almost surely, 2221010002121211 is an apocalyptic number.
221010002121211 is a deficient number, since it is larger than the sum of its proper divisors (1).
221010002121211 is an equidigital number, since it uses as much as digits as its factorization.
221010002121211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 221010002121211 its reverse (112121200010122), we get a palindrome (333131202131333).
The spelling of 221010002121211 in words is "two hundred twenty-one trillion, ten billion, two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •