Search a number
-
+
503461260361 is a prime number
BaseRepresentation
bin1110101001110001010…
…00010010110001001001
31210010112002011221211201
413110320220102301021
531222042040312421
61023141550024201
751242145050413
oct7247050226111
91703462157751
10503461260361
11184575835654
12816a81a8061
1338626272427
141a520bb99b3
15d16993bb91
hex7538a12c49

503461260361 has 2 divisors, whose sum is σ = 503461260362. Its totient is φ = 503461260360.

The previous prime is 503461260343. The next prime is 503461260373. The reversal of 503461260361 is 163062164305.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 325498775625 + 177962484736 = 570525^2 + 421856^2 .

It is a cyclic number.

It is not a de Polignac number, because 503461260361 - 213 = 503461252169 is a prime.

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

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

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

Almost surely, 2503461260361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 77760, while the sum is 37.

The spelling of 503461260361 in words is "five hundred three billion, four hundred sixty-one million, two hundred sixty thousand, three hundred sixty-one".