Search a number
-
+
555005005031 is a prime number
BaseRepresentation
bin10000001001110001110…
…00000100110011100111
31222001120020211111001002
420010320320010303213
533043122240130111
61102544335223515
755045353463451
oct10047070046347
91861506744032
10555005005031
111a4415946944
128b692077b9b
134044baac529
141cc105592d1
15e684abc63b
hex8138e04ce7

555005005031 has 2 divisors, whose sum is σ = 555005005032. Its totient is φ = 555005005030.

The previous prime is 555005005007. The next prime is 555005005109. The reversal of 555005005031 is 130500500555.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 555005005031 - 210 = 555005004007 is a prime.

It is a super-3 number, since 3×5550050050313 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

Almost surely, 2555005005031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9375, while the sum is 29.

Adding to 555005005031 its reverse (130500500555), we get a palindrome (685505505586).

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