Base | Representation |
---|---|
bin | 11110100010110… |
… | …001000010010101 |
3 | 1022201020011010101 |
4 | 132202301002111 |
5 | 2022140231404 |
6 | 122503054101 |
7 | 15461404453 |
oct | 3642610225 |
9 | 1281204111 |
10 | 512430229 |
11 | 243287463 |
12 | 123741331 |
13 | 82217b6c |
14 | 4c0ad9d3 |
15 | 2eec12a4 |
hex | 1e8b1095 |
512430229 has 2 divisors, whose sum is σ = 512430230. Its totient is φ = 512430228.
The previous prime is 512430199. The next prime is 512430241. The reversal of 512430229 is 922034215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 302238225 + 210192004 = 17385^2 + 14498^2 .
It is a cyclic number.
It is not a de Polignac number, because 512430229 - 25 = 512430197 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 512430197 and 512430206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (512434229) by changing a digit.
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, 256215114 + 256215115.
It is an arithmetic number, because the mean of its divisors is an integer number (256215115).
Almost surely, 2512430229 is an apocalyptic number.
It is an amenable number.
512430229 is a deficient number, since it is larger than the sum of its proper divisors (1).
512430229 is an equidigital number, since it uses as much as digits as its factorization.
512430229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 512430229 is about 22636.9218092920. The cubic root of 512430229 is about 800.2240148700.
It can be divided in two parts, 5124 and 30229, that added together give a palindrome (35353).
The spelling of 512430229 in words is "five hundred twelve million, four hundred thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •