Search a number
-
+
21600373061 is a prime number
BaseRepresentation
bin10100000111011110…
…111000100101000101
32001202100220122101002
4110013132320211011
5323214143414221
613531214543045
71363164066401
oct240736704505
961670818332
1021600373061
119184935a93
124229b07a85
132063111447
14108ca76101
158664e080b
hex5077b8945

21600373061 has 2 divisors, whose sum is σ = 21600373062. Its totient is φ = 21600373060.

The previous prime is 21600373049. The next prime is 21600373073. The reversal of 21600373061 is 16037300612.

It is a balanced prime because it is at equal distance from previous prime (21600373049) and next prime (21600373073).

It can be written as a sum of positive squares in only one way, i.e., 14015008225 + 7585364836 = 118385^2 + 87094^2 .

It is a cyclic number.

It is not a de Polignac number, because 21600373061 - 214 = 21600356677 is a prime.

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

It is a congruent number.

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

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

Almost surely, 221600373061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4536, while the sum is 29.

Adding to 21600373061 its reverse (16037300612), we get a palindrome (37637673673).

The spelling of 21600373061 in words is "twenty-one billion, six hundred million, three hundred seventy-three thousand, sixty-one".