Base | Representation |
---|---|
bin | 1100001111001001000… |
… | …1100001110000101011 |
3 | 202002121210212112122222 |
4 | 3003302101201300223 |
5 | 11421014104024321 |
6 | 240324122504255 |
7 | 21121344650651 |
oct | 3036221416053 |
9 | 662553775588 |
10 | 210223111211 |
11 | 81178513a43 |
12 | 348ab36508b |
13 | 16a932c61c9 |
14 | a263b20dd1 |
15 | 5705c043ab |
hex | 30f2461c2b |
210223111211 has 2 divisors, whose sum is σ = 210223111212. Its totient is φ = 210223111210.
The previous prime is 210223111121. The next prime is 210223111333. The reversal of 210223111211 is 112111322012.
It is a happy number.
Together with previous prime (210223111121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210223111211 - 214 = 210223094827 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210223111211.
It is not a weakly prime, because it can be changed into another prime (210223110211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105111555605 + 105111555606.
It is an arithmetic number, because the mean of its divisors is an integer number (105111555606).
Almost surely, 2210223111211 is an apocalyptic number.
210223111211 is a deficient number, since it is larger than the sum of its proper divisors (1).
210223111211 is an equidigital number, since it uses as much as digits as its factorization.
210223111211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 210223111211 its reverse (112111322012), we get a palindrome (322334433223).
The spelling of 210223111211 in words is "two hundred ten billion, two hundred twenty-three million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •