Base | Representation |
---|---|
bin | 11110100001101… |
… | …010011100000001 |
3 | 1022200200110110022 |
4 | 132201222130001 |
5 | 2022102003212 |
6 | 122452543225 |
7 | 15456061421 |
oct | 3641523401 |
9 | 1280613408 |
10 | 512141057 |
11 | 2430aa17a |
12 | 123621b15 |
13 | 8214635c |
14 | 4c036481 |
15 | 2ee65772 |
hex | 1e86a701 |
512141057 has 2 divisors, whose sum is σ = 512141058. Its totient is φ = 512141056.
The previous prime is 512141033. The next prime is 512141081. The reversal of 512141057 is 750141215.
It is a balanced prime because it is at equal distance from previous prime (512141033) and next prime (512141081).
It can be written as a sum of positive squares in only one way, i.e., 329458801 + 182682256 = 18151^2 + 13516^2 .
It is a cyclic number.
It is not a de Polignac number, because 512141057 - 210 = 512140033 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (512141557) 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, 256070528 + 256070529.
It is an arithmetic number, because the mean of its divisors is an integer number (256070529).
Almost surely, 2512141057 is an apocalyptic number.
It is an amenable number.
512141057 is a deficient number, since it is larger than the sum of its proper divisors (1).
512141057 is an equidigital number, since it uses as much as digits as its factorization.
512141057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1400, while the sum is 26.
The square root of 512141057 is about 22630.5337321063. The cubic root of 512141057 is about 800.0734604417.
The spelling of 512141057 in words is "five hundred twelve million, one hundred forty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •