Base | Representation |
---|---|
bin | 110000000001101001111101… |
… | …101110011111001110100111 |
3 | 1000200212102202201211121220102 |
4 | 300001221331232133032213 |
5 | 210141112040310134343 |
6 | 2025121044500454315 |
7 | 62330066530363661 |
oct | 6001517556371647 |
9 | 1020772681747812 |
10 | 211220011021223 |
11 | 613349a37aa926 |
12 | 1b833a2a3aa39b |
13 | 90b1c66768359 |
14 | 3a23162bd1531 |
15 | 19644b58b43b8 |
hex | c01a7db9f3a7 |
211220011021223 has 2 divisors, whose sum is σ = 211220011021224. Its totient is φ = 211220011021222.
The previous prime is 211220011021181. The next prime is 211220011021231. The reversal of 211220011021223 is 322120110022112.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211220011021223 is a prime.
It is a super-2 number, since 2×2112200110212232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211220011021195 and 211220011021204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211220011021273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105610005510611 + 105610005510612.
It is an arithmetic number, because the mean of its divisors is an integer number (105610005510612).
Almost surely, 2211220011021223 is an apocalyptic number.
211220011021223 is a deficient number, since it is larger than the sum of its proper divisors (1).
211220011021223 is an equidigital number, since it uses as much as digits as its factorization.
211220011021223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 211220011021223 its reverse (322120110022112), we get a palindrome (533340121043335).
The spelling of 211220011021223 in words is "two hundred eleven trillion, two hundred twenty billion, eleven million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •