Search a number
-
+
505339857361 is a prime number
BaseRepresentation
bin1110101101010001001…
…10100100100111010001
31210022101000002120110101
413112220212210213101
531234414000413421
61024052214532401
751336535625533
oct7265046444721
91708330076411
10505339857361
1118534a1a2359
1281b31367101
13388655210a1
141a65c4b1853
15d22981d191
hex75a89a49d1

505339857361 has 2 divisors, whose sum is σ = 505339857362. Its totient is φ = 505339857360.

The previous prime is 505339857359. The next prime is 505339857397. The reversal of 505339857361 is 163758933505.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 490498526736 + 14841330625 = 700356^2 + 121825^2 .

It is a cyclic number.

It is not a de Polignac number, because 505339857361 - 21 = 505339857359 is a prime.

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

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

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

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

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

Almost surely, 2505339857361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10206000, while the sum is 55.

The spelling of 505339857361 in words is "five hundred five billion, three hundred thirty-nine million, eight hundred fifty-seven thousand, three hundred sixty-one".