Search a number
-
+
506030553313 is a prime number
BaseRepresentation
bin1110101110100011100…
…01010111100011100001
31210101011010202120011221
413113101301113203201
531242322310201223
61024244530535041
751362623506415
oct7272161274341
91711133676157
10506030553313
1118567406745a
12820a4737481
133894565360c
141a6c6106d45
15d26a2a3b5d
hex75d1c578e1

506030553313 has 2 divisors, whose sum is σ = 506030553314. Its totient is φ = 506030553312.

The previous prime is 506030553311. The next prime is 506030553331. The reversal of 506030553313 is 313355030605.

Together with next prime (506030553331) 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., 381655835089 + 124374718224 = 617783^2 + 352668^2 .

It is a cyclic number.

It is not a de Polignac number, because 506030553313 - 21 = 506030553311 is a prime.

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

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

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

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

Almost surely, 2506030553313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60750, while the sum is 34.

Adding to 506030553313 its reverse (313355030605), we get a palindrome (819385583918).

The spelling of 506030553313 in words is "five hundred six billion, thirty million, five hundred fifty-three thousand, three hundred thirteen".