Base | Representation |
---|---|
bin | 100000010101100… |
… | …010011010110101 |
3 | 1101210211201022011 |
4 | 200111202122311 |
5 | 2102341020132 |
6 | 125500004221 |
7 | 16305213655 |
oct | 4025423265 |
9 | 1353751264 |
10 | 542516917 |
11 | 259266a98 |
12 | 131830671 |
13 | 88520437 |
14 | 520a2365 |
15 | 32965b47 |
hex | 205626b5 |
542516917 has 2 divisors, whose sum is σ = 542516918. Its totient is φ = 542516916.
The previous prime is 542516873. The next prime is 542516927. The reversal of 542516917 is 719615245.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 523906321 + 18610596 = 22889^2 + 4314^2 .
It is a cyclic number.
It is not a de Polignac number, because 542516917 - 27 = 542516789 is a prime.
It is equal to p28473484 and since 542516917 and 28473484 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 542516917.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (542516927) 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, 271258458 + 271258459.
It is an arithmetic number, because the mean of its divisors is an integer number (271258459).
Almost surely, 2542516917 is an apocalyptic number.
It is an amenable number.
542516917 is a deficient number, since it is larger than the sum of its proper divisors (1).
542516917 is an equidigital number, since it uses as much as digits as its factorization.
542516917 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75600, while the sum is 40.
The square root of 542516917 is about 23291.9925510893. The cubic root of 542516917 is about 815.5885028946.
The spelling of 542516917 in words is "five hundred forty-two million, five hundred sixteen thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •