Search a number
-
+
5660209151981 is a prime number
BaseRepresentation
bin101001001011101111011…
…0000010111111111101101
3202001002222201010000020022
41102113132300113333231
51220214102020330411
620012133021531525
71122636154650326
oct122273660277755
922032881100208
105660209151981
11189253256109a
12774ba0713ba5
133209a88bb807
14157d541a544d
159c37d357edb
hex525dec17fed

5660209151981 has 2 divisors, whose sum is σ = 5660209151982. Its totient is φ = 5660209151980.

The previous prime is 5660209151917. The next prime is 5660209152007. The reversal of 5660209151981 is 1891519020665.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5263050809956 + 397158342025 = 2294134^2 + 630205^2 .

It is a cyclic number.

It is not a de Polignac number, because 5660209151981 - 26 = 5660209151917 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 25660209151981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1166400, while the sum is 53.

The spelling of 5660209151981 in words is "five trillion, six hundred sixty billion, two hundred nine million, one hundred fifty-one thousand, nine hundred eighty-one".