Search a number
-
+
503514959061341 is a prime number
BaseRepresentation
bin111001001111100011011011…
…0010001100010000101011101
32110000210120010020011200112002
41302133012312101202011131
51011444042114004430331
64542515325013052045
7211025520034133153
oct16237066621420535
92400716106150462
10503514959061341
11136487549867157
12485806a5027025
13187c5345555836
148c4a37b1813d3
153d328a619e9cb
hex1c9f1b646215d

503514959061341 has 2 divisors, whose sum is σ = 503514959061342. Its totient is φ = 503514959061340.

The previous prime is 503514959061307. The next prime is 503514959061343. The reversal of 503514959061341 is 143160959415305.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 382209186129241 + 121305772932100 = 19550171^2 + 11013890^2 .

It is a cyclic number.

It is not a de Polignac number, because 503514959061341 - 210 = 503514959060317 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2503514959061341 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8748000, while the sum is 56.

The spelling of 503514959061341 in words is "five hundred three trillion, five hundred fourteen billion, nine hundred fifty-nine million, sixty-one thousand, three hundred forty-one".