Base | Representation |
---|---|
bin | 11011011111101… |
… | …01001000101101 |
3 | 121001222211122111 |
4 | 31233311020231 |
5 | 433021022341 |
6 | 34515244021 |
7 | 5500266205 |
oct | 1557651055 |
9 | 531884574 |
10 | 230642221 |
11 | 109211a07 |
12 | 652a9611 |
13 | 38a256b4 |
14 | 228bb405 |
15 | 153ad681 |
hex | dbf522d |
230642221 has 2 divisors, whose sum is σ = 230642222. Its totient is φ = 230642220.
The previous prime is 230642219. The next prime is 230642227. The reversal of 230642221 is 122246032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 209380900 + 21261321 = 14470^2 + 4611^2 .
It is a cyclic number.
It is not a de Polignac number, because 230642221 - 21 = 230642219 is a prime.
Together with 230642219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 230642192 and 230642201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230642227) 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, 115321110 + 115321111.
It is an arithmetic number, because the mean of its divisors is an integer number (115321111).
Almost surely, 2230642221 is an apocalyptic number.
It is an amenable number.
230642221 is a deficient number, since it is larger than the sum of its proper divisors (1).
230642221 is an equidigital number, since it uses as much as digits as its factorization.
230642221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 230642221 is about 15186.9095276162. The cubic root of 230642221 is about 613.2623042811.
Adding to 230642221 its reverse (122246032), we get a palindrome (352888253).
The spelling of 230642221 in words is "two hundred thirty million, six hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •