Base | Representation |
---|---|
bin | 110000000001101010111111… |
… | …010010100101000010000111 |
3 | 1000200212112121101122101210102 |
4 | 300001222333102211002013 |
5 | 210141121313404014343 |
6 | 2025121345553114315 |
7 | 62330136015144521 |
oct | 6001527722450207 |
9 | 1020775541571712 |
10 | 211221111001223 |
11 | 61335408701104 |
12 | 1b83409685899b |
13 | 90b20b060cbab |
14 | 3a23228d26a11 |
15 | 196452c2443b8 |
hex | c01abf4a5087 |
211221111001223 has 2 divisors, whose sum is σ = 211221111001224. Its totient is φ = 211221111001222.
The previous prime is 211221111001193. The next prime is 211221111001237. The reversal of 211221111001223 is 322100111122112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211221111001223 - 228 = 211220842565767 is a prime.
It is a super-2 number, since 2×2112211110012232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211221111001195 and 211221111001204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211221111001283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105610555500611 + 105610555500612.
It is an arithmetic number, because the mean of its divisors is an integer number (105610555500612).
Almost surely, 2211221111001223 is an apocalyptic number.
211221111001223 is a deficient number, since it is larger than the sum of its proper divisors (1).
211221111001223 is an equidigital number, since it uses as much as digits as its factorization.
211221111001223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 211221111001223 its reverse (322100111122112), we get a palindrome (533321222123335).
The spelling of 211221111001223 in words is "two hundred eleven trillion, two hundred twenty-one billion, one hundred eleven million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •