Search a number
-
+
530015661137 is a prime number
BaseRepresentation
bin1111011011001110110…
…01010010110001010001
31212200001200222021122202
413231213121102301101
532140433002124022
61043252535012545
753202165533444
oct7554731226121
91780050867582
10530015661137
11194862028a16
128687920a155
133ac98837401
141b91d78765b
15dbc0d02592
hex7b67652c51

530015661137 has 2 divisors, whose sum is σ = 530015661138. Its totient is φ = 530015661136.

The previous prime is 530015661053. The next prime is 530015661173. The reversal of 530015661137 is 731166510035.

It is a happy number.

Together with next prime (530015661173) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 286563219856 + 243452441281 = 535316^2 + 493409^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 530015661137.

It is not a weakly prime, because it can be changed into another prime (530015661737) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265007830568 + 265007830569.

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

Almost surely, 2530015661137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 38.

The spelling of 530015661137 in words is "five hundred thirty billion, fifteen million, six hundred sixty-one thousand, one hundred thirty-seven".