Search a number
-
+
1051505489 is a prime number
BaseRepresentation
bin111110101011001…
…011001101010001
32201021121000100202
4332223023031101
54123141133424
6252201224545
735025435446
oct7653131521
92637530322
101051505489
1149a602701
12254192155
13139b018c8
149d9179cd
15624a72ae
hex3eacb351

1051505489 has 2 divisors, whose sum is σ = 1051505490. Its totient is φ = 1051505488.

The previous prime is 1051505447. The next prime is 1051505491. The reversal of 1051505489 is 9845051501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 756250000 + 295255489 = 27500^2 + 17183^2 .

It is a cyclic number.

It is not a de Polignac number, because 1051505489 - 212 = 1051501393 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

Almost surely, 21051505489 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1051505489 is about 32426.9253707471. The cubic root of 1051505489 is about 1016.8818942105.

The spelling of 1051505489 in words is "one billion, fifty-one million, five hundred five thousand, four hundred eighty-nine".