Base | Representation |
---|---|
bin | 111010010010000101100001… |
… | …0001100110000000000100101 |
3 | 2111020011201212020100002021101 |
4 | 1310210023002030300000211 |
5 | 1014143401411443214204 |
6 | 5014200205410120101 |
7 | 212661254341024453 |
oct | 16444130214600045 |
9 | 2436151766302241 |
10 | 512659144507429 |
11 | 139392582094a77 |
12 | 495b893a280031 |
13 | 1900971c15891a |
14 | 9084b992bd9d3 |
15 | 3e40692c54ea4 |
hex | 1d242c2330025 |
512659144507429 has 2 divisors, whose sum is σ = 512659144507430. Its totient is φ = 512659144507428.
The previous prime is 512659144507343. The next prime is 512659144507439. The reversal of 512659144507429 is 924705441956215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 471301087680900 + 41358056826529 = 21709470^2 + 6431023^2 .
It is a cyclic number.
It is not a de Polignac number, because 512659144507429 - 211 = 512659144505381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (512659144507439) 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, 256329572253714 + 256329572253715.
It is an arithmetic number, because the mean of its divisors is an integer number (256329572253715).
Almost surely, 2512659144507429 is an apocalyptic number.
It is an amenable number.
512659144507429 is a deficient number, since it is larger than the sum of its proper divisors (1).
512659144507429 is an equidigital number, since it uses as much as digits as its factorization.
512659144507429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864000, while the sum is 64.
The spelling of 512659144507429 in words is "five hundred twelve trillion, six hundred fifty-nine billion, one hundred forty-four million, five hundred seven thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •