Search a number
-
+
530090909 is a prime number
BaseRepresentation
bin11111100110001…
…000101110011101
31100221110102000122
4133212020232131
52041200402114
6124333404325
716064461355
oct3746105635
91327412018
10530090909
1125224a167
121296396a5
1385a8c57a
1450589b65
153180de8e
hex1f988b9d

530090909 has 2 divisors, whose sum is σ = 530090910. Its totient is φ = 530090908.

The previous prime is 530090903. The next prime is 530090921. The reversal of 530090909 is 909090035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 508728025 + 21362884 = 22555^2 + 4622^2 .

It is a cyclic number.

It is not a de Polignac number, because 530090909 - 212 = 530086813 is a prime.

It is a Chen prime.

530090909 is a modest number, since divided by 90909 gives 530 as remainder.

It is equal to p27855323 and since 530090909 and 27855323 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

Almost surely, 2530090909 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10935, while the sum is 35.

The square root of 530090909 is about 23023.7031990946. The cubic root of 530090909 is about 809.3135010472.

The spelling of 530090909 in words is "five hundred thirty million, ninety thousand, nine hundred nine".