Search a number
-
+
621503120213 is a prime number
BaseRepresentation
bin10010000101101000111…
…10010000001101010101
32012102012121202202000222
421002310132100031111
540140314244321323
61153303052444125
762621266233413
oct11026436201525
92172177682028
10621503120213
1121a63a344028
12a0550179645
13467b887a691
142211c0422b3
1511277a4c9c8
hex90b4790355

621503120213 has 2 divisors, whose sum is σ = 621503120214. Its totient is φ = 621503120212.

The previous prime is 621503120209. The next prime is 621503120237. The reversal of 621503120213 is 312021305126.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 564507287569 + 56995832644 = 751337^2 + 238738^2 .

It is a cyclic number.

It is not a de Polignac number, because 621503120213 - 22 = 621503120209 is a prime.

It is a super-2 number, since 2×6215031202132 (a number of 24 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 2621503120213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 26.

Adding to 621503120213 its reverse (312021305126), we get a palindrome (933524425339).

The spelling of 621503120213 in words is "six hundred twenty-one billion, five hundred three million, one hundred twenty thousand, two hundred thirteen".