Search a number
-
+
557071513 is a prime number
BaseRepresentation
bin100001001101000…
…011110010011001
31102211020011110021
4201031003302121
52120102242023
6131135550441
716543013125
oct4115036231
91384204407
10557071513
112664a8089
1213668b421
138b54811b
1453db0585
1533d8d35d
hex21343c99

557071513 has 2 divisors, whose sum is σ = 557071514. Its totient is φ = 557071512.

The previous prime is 557071511. The next prime is 557071547. The reversal of 557071513 is 315170755.

It is an a-pointer prime, because the next prime (557071547) can be obtained adding 557071513 to its sum of digits (34).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 530979849 + 26091664 = 23043^2 + 5108^2 .

It is a cyclic number.

It is not a de Polignac number, because 557071513 - 21 = 557071511 is a prime.

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

Together with 557071511, it forms a pair of twin primes.

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

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

Almost surely, 2557071513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18375, while the sum is 34.

The square root of 557071513 is about 23602.3624453147. The cubic root of 557071513 is about 822.8177468632.

The spelling of 557071513 in words is "five hundred fifty-seven million, seventy-one thousand, five hundred thirteen".