Search a number
-
+
555251559113 is a prime number
BaseRepresentation
bin10000001010001111001…
…00100110101011001001
31222002012102202201122202
420011013210212223021
533044123344342423
61103025023525545
755054436244146
oct10050744465311
91862172681582
10555251559113
111a4532036649
128b7407598b5
134048abb6614
141cc351b93cd
15e69b570728
hex8147926ac9

555251559113 has 2 divisors, whose sum is σ = 555251559114. Its totient is φ = 555251559112.

The previous prime is 555251559097. The next prime is 555251559131. The reversal of 555251559113 is 311955152555.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 555245541904 + 6017209 = 745148^2 + 2453^2 .

It is a cyclic number.

It is not a de Polignac number, because 555251559113 - 24 = 555251559097 is a prime.

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

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

Almost surely, 2555251559113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 843750, while the sum is 47.

The spelling of 555251559113 in words is "five hundred fifty-five billion, two hundred fifty-one million, five hundred fifty-nine thousand, one hundred thirteen".