Base | Representation |
---|---|
bin | 11010100010100… |
… | …00000110110111 |
3 | 120111220120202222 |
4 | 31101100012313 |
5 | 423443014411 |
6 | 34031352555 |
7 | 5342202032 |
oct | 1521200667 |
9 | 514816688 |
10 | 222626231 |
11 | 104737423 |
12 | 6268275b |
13 | 37179bc9 |
14 | 217d2019 |
15 | 148284db |
hex | d4501b7 |
222626231 has 2 divisors, whose sum is σ = 222626232. Its totient is φ = 222626230.
The previous prime is 222626213. The next prime is 222626273. The reversal of 222626231 is 132626222.
Together with previous prime (222626213) 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 a de Polignac number, because none of the positive numbers 2k-222626231 is a prime.
It is a super-2 number, since 2×2226262312 = 99124877458530722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 222626231.
It is a congruent number.
It is a weakly prime.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111313115 + 111313116.
It is an arithmetic number, because the mean of its divisors is an integer number (111313116).
Almost surely, 2222626231 is an apocalyptic number.
222626231 is a deficient number, since it is larger than the sum of its proper divisors (1).
222626231 is an equidigital number, since it uses as much as digits as its factorization.
222626231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 26.
The square root of 222626231 is about 14920.6645629476. The cubic root of 222626231 is about 606.0737083896.
Subtracting from 222626231 its reverse (132626222), we obtain a palindrome (90000009).
The spelling of 222626231 in words is "two hundred twenty-two million, six hundred twenty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •