Base | Representation |
---|---|
bin | 11111100011001… |
… | …000001000011001 |
3 | 1100212222022220022 |
4 | 133203020020121 |
5 | 2041000131131 |
6 | 124304440225 |
7 | 16054664432 |
oct | 3743101031 |
9 | 1325868808 |
10 | 529302041 |
11 | 251860504 |
12 | 129319075 |
13 | 85874498 |
14 | 50422489 |
15 | 3170537b |
hex | 1f8c8219 |
529302041 has 2 divisors, whose sum is σ = 529302042. Its totient is φ = 529302040.
The previous prime is 529302031. The next prime is 529302079. The reversal of 529302041 is 140203925.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 510940816 + 18361225 = 22604^2 + 4285^2 .
It is a cyclic number.
It is not a de Polignac number, because 529302041 - 214 = 529285657 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 529302041.
It is not a weakly prime, because it can be changed into another prime (529302031) 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, 264651020 + 264651021.
It is an arithmetic number, because the mean of its divisors is an integer number (264651021).
Almost surely, 2529302041 is an apocalyptic number.
It is an amenable number.
529302041 is a deficient number, since it is larger than the sum of its proper divisors (1).
529302041 is an equidigital number, since it uses as much as digits as its factorization.
529302041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 529302041 is about 23006.5651717070. The cubic root of 529302041 is about 808.9118350446.
Adding to 529302041 its reverse (140203925), we get a palindrome (669505966).
The spelling of 529302041 in words is "five hundred twenty-nine million, three hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •