Search a number
-
+
5606219137 is a prime number
BaseRepresentation
bin1010011100010100…
…00001110110000001
3112110201002102212211
411032022001312001
542440143003022
62324144422121
7255633035131
oct51612016601
915421072784
105606219137
112417623462
121105617941
136b462413c
143b27c6ac1
1522c2a1e77
hex14e281d81

5606219137 has 2 divisors, whose sum is σ = 5606219138. Its totient is φ = 5606219136.

The previous prime is 5606219131. The next prime is 5606219141. The reversal of 5606219137 is 7319126065.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5565756816 + 40462321 = 74604^2 + 6361^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5606219137 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 25606219137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 40.

The square root of 5606219137 is about 74874.6895619608. The cubic root of 5606219137 is about 1776.4651408328.

The spelling of 5606219137 in words is "five billion, six hundred six million, two hundred nineteen thousand, one hundred thirty-seven".