Search a number
-
+
501505002352397 is a prime number
BaseRepresentation
bin111001000000111011011101…
…1100001001010111100001101
32102202200102001220000121121002
41302001312323201022330031
51011213124221100234042
64534340114553150045
7210430353321036131
oct16201667341127415
92382612056017532
10501505002352397
1113588209368a59a
12482b70426bb325
13186aa946280814
148bbad861db3c1
153cea469016132
hex1c81dbb84af0d

501505002352397 has 2 divisors, whose sum is σ = 501505002352398. Its totient is φ = 501505002352396.

The previous prime is 501505002352273. The next prime is 501505002352411. The reversal of 501505002352397 is 793253200505105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 311289351839236 + 190215650513161 = 17643394^2 + 13791869^2 .

It is a cyclic number.

It is not a de Polignac number, because 501505002352397 - 228 = 501504733916941 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2501505002352397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1417500, while the sum is 47.

The spelling of 501505002352397 in words is "five hundred one trillion, five hundred five billion, two million, three hundred fifty-two thousand, three hundred ninety-seven".