Search a number
-
+
530115881 is a prime number
BaseRepresentation
bin11111100110001…
…110110100101001
31100221111200021112
4133212032310221
52041202202011
6124334120105
716064624231
oct3746166451
91327450245
10530115881
112522669a9
12129650035
1385a9aa49
1450594cc1
153181658b
hex1f98ed29

530115881 has 2 divisors, whose sum is σ = 530115882. Its totient is φ = 530115880.

The previous prime is 530115869. The next prime is 530115889. The reversal of 530115881 is 188511035.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 437186281 + 92929600 = 20909^2 + 9640^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-530115881 is a prime.

It is a super-2 number, since 2×5301158812 = 562045694576812322, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (530115889) 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, 265057940 + 265057941.

It is an arithmetic number, because the mean of its divisors is an integer number (265057941).

Almost surely, 2530115881 is an apocalyptic number.

It is an amenable number.

530115881 is a deficient number, since it is larger than the sum of its proper divisors (1).

530115881 is an equidigital number, since it uses as much as digits as its factorization.

530115881 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 4800, while the sum is 32.

The square root of 530115881 is about 23024.2455033819. The cubic root of 530115881 is about 809.3262094707.

The spelling of 530115881 in words is "five hundred thirty million, one hundred fifteen thousand, eight hundred eighty-one".