Base | Representation |
---|---|
bin | 110000000011010011001110… |
… | …001100000100010011001111 |
3 | 1000201021020111020011210211022 |
4 | 300003103032030010103033 |
5 | 210144440021201232343 |
6 | 2025245015335544355 |
7 | 62341210331620601 |
oct | 6003231614042317 |
9 | 1021236436153738 |
10 | 211333030102223 |
11 | 613789200631a7 |
12 | 1b85191022b0bb |
13 | 90bc80859a803 |
14 | 3a28804d47171 |
15 | 19673cca6e568 |
hex | c034ce3044cf |
211333030102223 has 2 divisors, whose sum is σ = 211333030102224. Its totient is φ = 211333030102222.
The previous prime is 211333030102217. The next prime is 211333030102241. The reversal of 211333030102223 is 322201030333112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211333030102223 - 220 = 211333029053647 is a prime.
It is a super-2 number, since 2×2113330301022232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211333030102192 and 211333030102201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211333030107223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105666515051111 + 105666515051112.
It is an arithmetic number, because the mean of its divisors is an integer number (105666515051112).
Almost surely, 2211333030102223 is an apocalyptic number.
211333030102223 is a deficient number, since it is larger than the sum of its proper divisors (1).
211333030102223 is an equidigital number, since it uses as much as digits as its factorization.
211333030102223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 211333030102223 its reverse (322201030333112), we get a palindrome (533534060435335).
The spelling of 211333030102223 in words is "two hundred eleven trillion, three hundred thirty-three billion, thirty million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •