Search a number
-
+
519096353 is a prime number
BaseRepresentation
bin11110111100001…
…100100000100001
31100011202211022212
4132330030200201
52030342040403
6123302011505
715602150306
oct3674144041
91304684285
10519096353
1124701a856
12125a16b95
1383710109
144cd270ad
153088b4d8
hex1ef0c821

519096353 has 2 divisors, whose sum is σ = 519096354. Its totient is φ = 519096352.

The previous prime is 519096323. The next prime is 519096437. The reversal of 519096353 is 353690915.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 486114304 + 32982049 = 22048^2 + 5743^2 .

It is a cyclic number.

It is not a de Polignac number, because 519096353 - 224 = 502319137 is a prime.

It is a super-2 number, since 2×5190963532 = 538922047395801218, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 519096353.

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

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

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

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

Almost surely, 2519096353 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 109350, while the sum is 41.

The square root of 519096353 is about 22783.6861152887. The cubic root of 519096353 is about 803.6790717893.

The spelling of 519096353 in words is "five hundred nineteen million, ninety-six thousand, three hundred fifty-three".