Search a number
-
+
551505136909 is a prime number
BaseRepresentation
bin10000000011010000100…
…01001000110100001101
31221201112100012202112211
420001220101020310031
533013440303340114
61101205153030421
754562545213346
oct10015021106415
91851470182484
10551505136909
111a298a2aa151
128aa75b55411
134001198ac4c
141c99b7d30cd
15e52c6d96c4
hex8068448d0d

551505136909 has 2 divisors, whose sum is σ = 551505136910. Its totient is φ = 551505136908.

The previous prime is 551505136753. The next prime is 551505136921. The reversal of 551505136909 is 909631505155.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 429667140100 + 121837996809 = 655490^2 + 349053^2 .

It is a cyclic number.

It is not a de Polignac number, because 551505136909 - 29 = 551505136397 is a prime.

It is a super-3 number, since 3×5515051369093 (a number of 36 digits) contains 333 as substring.

It is a congruent number.

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

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

Almost surely, 2551505136909 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 911250, while the sum is 49.

The spelling of 551505136909 in words is "five hundred fifty-one billion, five hundred five million, one hundred thirty-six thousand, nine hundred nine".