Base | Representation |
---|---|
bin | 110000000001101100000001… |
… | …011101101001111011110011 |
3 | 1000200212122110202200101202211 |
4 | 300001230001131221323303 |
5 | 210141131102111414024 |
6 | 2025122052052352551 |
7 | 62330205355532131 |
oct | 6001540135517363 |
9 | 1020778422611684 |
10 | 211222221201139 |
11 | 613359283527a5 |
12 | 1b834346615757 |
13 | 90b2229622415 |
14 | 3a232d255c751 |
15 | 1964594942594 |
hex | c01b01769ef3 |
211222221201139 has 2 divisors, whose sum is σ = 211222221201140. Its totient is φ = 211222221201138.
The previous prime is 211222221201071. The next prime is 211222221201149. The reversal of 211222221201139 is 931102122222112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211222221201139 - 237 = 211084782247667 is a prime.
It is a super-2 number, since 2×2112222212011392 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211222221201139.
It is not a weakly prime, because it can be changed into another prime (211222221201149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105611110600569 + 105611110600570.
It is an arithmetic number, because the mean of its divisors is an integer number (105611110600570).
Almost surely, 2211222221201139 is an apocalyptic number.
211222221201139 is a deficient number, since it is larger than the sum of its proper divisors (1).
211222221201139 is an equidigital number, since it uses as much as digits as its factorization.
211222221201139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
The spelling of 211222221201139 in words is "two hundred eleven trillion, two hundred twenty-two billion, two hundred twenty-one million, two hundred one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •