Base | Representation |
---|---|
bin | 11010100110010… |
… | …11111000101111 |
3 | 120112212100020202 |
4 | 31103023320233 |
5 | 424110230411 |
6 | 34050304115 |
7 | 5346413126 |
oct | 1523137057 |
9 | 515770222 |
10 | 223133231 |
11 | 104a53332 |
12 | 6288803b |
13 | 372c68c9 |
14 | 218c4abd |
15 | 148c883b |
hex | d4cbe2f |
223133231 has 2 divisors, whose sum is σ = 223133232. Its totient is φ = 223133230.
The previous prime is 223133213. The next prime is 223133237. The reversal of 223133231 is 132331322.
Together with previous prime (223133213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 223133231 - 226 = 156024367 is a prime.
It is a super-3 number, since 3×2231332313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223133237) 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, 111566615 + 111566616.
It is an arithmetic number, because the mean of its divisors is an integer number (111566616).
Almost surely, 2223133231 is an apocalyptic number.
223133231 is a deficient number, since it is larger than the sum of its proper divisors (1).
223133231 is an equidigital number, since it uses as much as digits as its factorization.
223133231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 20.
The square root of 223133231 is about 14937.6447608048. The cubic root of 223133231 is about 606.5334421799.
Adding to 223133231 its reverse (132331322), we get a palindrome (355464553).
The spelling of 223133231 in words is "two hundred twenty-three million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •