Base | Representation |
---|---|
bin | 11011011101001… |
… | …11000011101101 |
3 | 121001101120221202 |
4 | 31232213003231 |
5 | 432430304123 |
6 | 34504335245 |
7 | 5464464626 |
oct | 1556470355 |
9 | 531346852 |
10 | 230322413 |
11 | 109013702 |
12 | 65174525 |
13 | 38942c69 |
14 | 22836a4d |
15 | 15348a28 |
hex | dba70ed |
230322413 has 2 divisors, whose sum is σ = 230322414. Its totient is φ = 230322412.
The previous prime is 230322383. The next prime is 230322431. The reversal of 230322413 is 314223032.
Together with next prime (230322431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123365449 + 106956964 = 11107^2 + 10342^2 .
It is a cyclic number.
It is not a de Polignac number, because 230322413 - 212 = 230318317 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230322913) 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, 115161206 + 115161207.
It is an arithmetic number, because the mean of its divisors is an integer number (115161207).
Almost surely, 2230322413 is an apocalyptic number.
It is an amenable number.
230322413 is a deficient number, since it is larger than the sum of its proper divisors (1).
230322413 is an equidigital number, since it uses as much as digits as its factorization.
230322413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 230322413 is about 15176.3768073938. The cubic root of 230322413 is about 612.9787237794.
Adding to 230322413 its reverse (314223032), we get a palindrome (544545445).
The spelling of 230322413 in words is "two hundred thirty million, three hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •