Search a number
-
+
551043345133 is a prime number
BaseRepresentation
bin10000000010011001011…
…11100010101011101101
31221200100011021022022201
420001030233202223231
533012014044021013
61101051255141501
754545240102551
oct10011457425355
91850304238281
10551043345133
111a277266a156
128a967374891
133cc6a0c2c88
141c956345861
15e501dbc3dd
hex804cbe2aed

551043345133 has 2 divisors, whose sum is σ = 551043345134. Its totient is φ = 551043345132.

The previous prime is 551043345043. The next prime is 551043345163. The reversal of 551043345133 is 331543340155.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 351522109449 + 199521235684 = 592893^2 + 446678^2 .

It is a cyclic number.

It is not a de Polignac number, because 551043345133 - 213 = 551043336941 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 551043345092 and 551043345101.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2551043345133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162000, while the sum is 37.

Adding to 551043345133 its reverse (331543340155), we get a palindrome (882586685288).

The spelling of 551043345133 in words is "five hundred fifty-one billion, forty-three million, three hundred forty-five thousand, one hundred thirty-three".